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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 16:54:12,141 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 16:54:12,144 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 16:54:12,163 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 16:54:12,164 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 16:54:12,165 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 16:54:12,167 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 16:54:12,169 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 16:54:12,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 16:54:12,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 16:54:12,181 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 16:54:12,181 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 16:54:12,182 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 16:54:12,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 16:54:12,187 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 16:54:12,188 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 16:54:12,189 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 16:54:12,191 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 16:54:12,195 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 16:54:12,196 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 16:54:12,199 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 16:54:12,201 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 16:54:12,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 16:54:12,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 16:54:12,205 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 16:54:12,206 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 16:54:12,210 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 16:54:12,211 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 16:54:12,212 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 16:54:12,216 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 16:54:12,216 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 16:54:12,217 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 16:54:12,217 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 16:54:12,217 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 16:54:12,219 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 16:54:12,219 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 16:54:12,220 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 16:54:12,241 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 16:54:12,241 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 16:54:12,244 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 16:54:12,244 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 16:54:12,245 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 16:54:12,245 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 16:54:12,245 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 16:54:12,245 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 16:54:12,245 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 16:54:12,245 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 16:54:12,246 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 16:54:12,246 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 16:54:12,246 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 16:54:12,246 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 16:54:12,248 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 16:54:12,248 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 16:54:12,248 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 16:54:12,248 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 16:54:12,249 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 16:54:12,249 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 16:54:12,249 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 16:54:12,249 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 16:54:12,249 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 16:54:12,249 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 16:54:12,250 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 16:54:12,251 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 16:54:12,251 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 16:54:12,252 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 16:54:12,252 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 16:54:12,252 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 16:54:12,252 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 16:54:12,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 16:54:12,253 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 16:54:12,253 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 16:54:12,253 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 16:54:12,253 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 16:54:12,253 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 16:54:12,254 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 16:54:12,254 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 16:54:12,254 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 16:54:12,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 16:54:12,319 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 16:54:12,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 16:54:12,325 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 16:54:12,326 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 16:54:12,327 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 16:54:12,327 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl' [2019-01-31 16:54:12,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 16:54:12,384 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 16:54:12,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 16:54:12,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 16:54:12,385 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 16:54:12,402 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 04:54:12" (1/1) ... [2019-01-31 16:54:12,414 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 04:54:12" (1/1) ... [2019-01-31 16:54:12,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 16:54:12,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 16:54:12,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 16:54:12,425 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 16:54:12,434 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 04:54:12" (1/1) ... [2019-01-31 16:54:12,434 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 04:54:12" (1/1) ... [2019-01-31 16:54:12,435 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 04:54:12" (1/1) ... [2019-01-31 16:54:12,435 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 04:54:12" (1/1) ... [2019-01-31 16:54:12,438 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 04:54:12" (1/1) ... [2019-01-31 16:54:12,439 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 04:54:12" (1/1) ... [2019-01-31 16:54:12,440 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 04:54:12" (1/1) ... [2019-01-31 16:54:12,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 16:54:12,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 16:54:12,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 16:54:12,442 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 16:54:12,443 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 04:54:12" (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 16:54:12,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 16:54:12,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 16:54:12,721 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 16:54:12,722 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-31 16:54:12,723 INFO L202 PluginConnector]: Adding new model array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:54:12 BoogieIcfgContainer [2019-01-31 16:54:12,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 16:54:12,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 16:54:12,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 16:54:12,728 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 16:54:12,728 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 04:54:12" (1/2) ... [2019-01-31 16:54:12,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc6f57e and model type array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:54:12, skipping insertion in model container [2019-01-31 16:54:12,729 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 04:54:12" (2/2) ... [2019-01-31 16:54:12,732 INFO L112 eAbstractionObserver]: Analyzing ICFG array4.i_4.bpl [2019-01-31 16:54:12,743 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 16:54:12,752 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 16:54:12,771 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 16:54:12,807 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 16:54:12,807 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 16:54:12,807 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 16:54:12,808 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 16:54:12,808 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 16:54:12,808 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 16:54:12,808 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 16:54:12,808 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 16:54:12,825 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-31 16:54:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 16:54:12,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:12,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 16:54:12,844 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:12,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:12,855 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-31 16:54:12,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:12,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:12,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:12,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:12,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:13,080 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 16:54:13,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 16:54:13,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 16:54:13,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 16:54:13,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 16:54:13,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 16:54:13,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 16:54:13,103 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-31 16:54:13,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:13,211 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-31 16:54:13,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 16:54:13,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 16:54:13,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:13,226 INFO L225 Difference]: With dead ends: 12 [2019-01-31 16:54:13,226 INFO L226 Difference]: Without dead ends: 7 [2019-01-31 16:54:13,230 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 16:54:13,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-31 16:54:13,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-31 16:54:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 16:54:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-31 16:54:13,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-31 16:54:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:13,269 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-31 16:54:13,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 16:54:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-31 16:54:13,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 16:54:13,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:13,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 16:54:13,271 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:13,271 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-31 16:54:13,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:13,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:13,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:13,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:13,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:13,428 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 16:54:13,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:13,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:13,430 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 16:54:13,432 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-31 16:54:13,511 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 16:54:13,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 16:54:13,763 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 16:54:13,764 INFO L272 AbstractInterpreter]: Visited 6 different actions 18 times. Merged at 4 different actions 9 times. Never widened. Performed 166 root evaluator evaluations with a maximum evaluation depth of 5. Performed 166 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 16:54:13,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:13,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 16:54:13,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:13,773 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 16:54:13,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:13,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:13,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:13,843 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 16:54:13,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:14,069 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 16:54:14,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:14,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-31 16:54:14,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:14,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 16:54:14,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 16:54:14,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 16:54:14,093 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-01-31 16:54:14,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:14,158 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-31 16:54:14,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 16:54:14,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-31 16:54:14,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:14,159 INFO L225 Difference]: With dead ends: 13 [2019-01-31 16:54:14,159 INFO L226 Difference]: Without dead ends: 9 [2019-01-31 16:54:14,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 16:54:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-31 16:54:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-31 16:54:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 16:54:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-31 16:54:14,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-01-31 16:54:14,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:14,164 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-31 16:54:14,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 16:54:14,164 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-31 16:54:14,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 16:54:14,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:14,165 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-31 16:54:14,165 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:14,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:14,166 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-01-31 16:54:14,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:14,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:14,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:14,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:14,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:14,234 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 16:54:14,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:14,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:14,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:14,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:14,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:14,235 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 16:54:14,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:14,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:14,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 16:54:14,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:14,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:14,297 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 16:54:14,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:14,515 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 16:54:14,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:14,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-31 16:54:14,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:14,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 16:54:14,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 16:54:14,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-31 16:54:14,547 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-01-31 16:54:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:14,680 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-31 16:54:14,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 16:54:14,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-31 16:54:14,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:14,682 INFO L225 Difference]: With dead ends: 16 [2019-01-31 16:54:14,682 INFO L226 Difference]: Without dead ends: 11 [2019-01-31 16:54:14,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-31 16:54:14,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-31 16:54:14,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-31 16:54:14,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-31 16:54:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-31 16:54:14,686 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-31 16:54:14,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:14,686 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-31 16:54:14,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 16:54:14,686 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-31 16:54:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 16:54:14,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:14,687 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-31 16:54:14,688 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:14,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:14,688 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-01-31 16:54:14,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:14,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:14,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:14,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:14,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:14,802 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 16:54:14,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:14,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:14,803 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:14,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:14,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:14,804 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 16:54:14,824 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:14,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:14,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:14,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:14,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:14,850 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 16:54:14,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:15,018 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 16:54:15,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:15,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-31 16:54:15,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:15,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 16:54:15,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 16:54:15,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-31 16:54:15,049 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-01-31 16:54:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:15,096 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-31 16:54:15,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 16:54:15,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-31 16:54:15,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:15,098 INFO L225 Difference]: With dead ends: 19 [2019-01-31 16:54:15,098 INFO L226 Difference]: Without dead ends: 13 [2019-01-31 16:54:15,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-31 16:54:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-31 16:54:15,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-31 16:54:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 16:54:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-31 16:54:15,103 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-31 16:54:15,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:15,103 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-31 16:54:15,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 16:54:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-31 16:54:15,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-31 16:54:15,104 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:15,104 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-31 16:54:15,105 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:15,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:15,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-01-31 16:54:15,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:15,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:15,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:15,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:15,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:15,184 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 16:54:15,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:15,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:15,185 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:15,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:15,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:15,186 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 16:54:15,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:15,201 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:15,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:15,233 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 16:54:15,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:15,341 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 16:54:15,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:15,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-31 16:54:15,360 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:15,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 16:54:15,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 16:54:15,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-31 16:54:15,362 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-01-31 16:54:15,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:15,443 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-31 16:54:15,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 16:54:15,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-31 16:54:15,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:15,444 INFO L225 Difference]: With dead ends: 22 [2019-01-31 16:54:15,445 INFO L226 Difference]: Without dead ends: 15 [2019-01-31 16:54:15,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-31 16:54:15,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-31 16:54:15,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-31 16:54:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-31 16:54:15,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-31 16:54:15,449 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-31 16:54:15,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:15,449 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-31 16:54:15,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 16:54:15,450 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-31 16:54:15,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-31 16:54:15,450 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:15,450 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-31 16:54:15,451 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:15,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:15,451 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-01-31 16:54:15,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:15,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:15,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:15,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:15,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:15,843 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 16:54:15,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:15,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:15,843 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:15,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:15,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:15,844 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 16:54:15,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:15,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:15,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 16:54:15,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:15,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:15,894 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 16:54:15,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:16,049 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 16:54:16,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:16,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-31 16:54:16,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:16,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 16:54:16,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 16:54:16,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-31 16:54:16,071 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-01-31 16:54:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:16,124 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-01-31 16:54:16,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 16:54:16,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-31 16:54:16,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:16,126 INFO L225 Difference]: With dead ends: 25 [2019-01-31 16:54:16,126 INFO L226 Difference]: Without dead ends: 17 [2019-01-31 16:54:16,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-31 16:54:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-31 16:54:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-31 16:54:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 16:54:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-31 16:54:16,142 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-01-31 16:54:16,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:16,142 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-31 16:54:16,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 16:54:16,143 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-31 16:54:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-31 16:54:16,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:16,143 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-31 16:54:16,144 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:16,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:16,144 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-01-31 16:54:16,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:16,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:16,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:16,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:16,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:16,249 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 16:54:16,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:16,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:16,250 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:16,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:16,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:16,251 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 16:54:16,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:16,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:16,279 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:16,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:16,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:16,291 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 16:54:16,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:16,467 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 16:54:16,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:16,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-31 16:54:16,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:16,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 16:54:16,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 16:54:16,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-31 16:54:16,488 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-01-31 16:54:16,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:16,573 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-31 16:54:16,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 16:54:16,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-31 16:54:16,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:16,575 INFO L225 Difference]: With dead ends: 28 [2019-01-31 16:54:16,575 INFO L226 Difference]: Without dead ends: 19 [2019-01-31 16:54:16,576 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 16:54:16,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-31 16:54:16,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-31 16:54:16,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-31 16:54:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-31 16:54:16,580 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-31 16:54:16,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:16,580 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-31 16:54:16,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 16:54:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-31 16:54:16,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-31 16:54:16,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:16,581 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-31 16:54:16,582 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:16,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:16,582 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-01-31 16:54:16,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:16,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:16,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:16,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:16,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:16,872 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 16:54:16,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:16,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:16,873 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:16,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 16:54:16,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:16,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 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 16:54:16,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:16,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:16,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:16,908 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 16:54:16,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:17,090 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 16:54:17,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:17,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-31 16:54:17,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:17,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 16:54:17,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 16:54:17,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-31 16:54:17,112 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-01-31 16:54:17,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:17,158 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-31 16:54:17,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 16:54:17,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-31 16:54:17,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:17,163 INFO L225 Difference]: With dead ends: 31 [2019-01-31 16:54:17,163 INFO L226 Difference]: Without dead ends: 21 [2019-01-31 16:54:17,163 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 16:54:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-31 16:54:17,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-31 16:54:17,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-31 16:54:17,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-31 16:54:17,167 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-01-31 16:54:17,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:17,167 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-31 16:54:17,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 16:54:17,168 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-31 16:54:17,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-31 16:54:17,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:17,168 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-31 16:54:17,168 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:17,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:17,169 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-01-31 16:54:17,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:17,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:17,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:17,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:17,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:17,494 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 16:54:17,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:17,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:17,495 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:17,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:17,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:17,495 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 16:54:17,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:17,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:17,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-31 16:54:17,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:17,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:17,544 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 16:54:17,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:17,767 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 16:54:17,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:17,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-31 16:54:17,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:17,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 16:54:17,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 16:54:17,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-31 16:54:17,788 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-01-31 16:54:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:18,019 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-01-31 16:54:18,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 16:54:18,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-31 16:54:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:18,020 INFO L225 Difference]: With dead ends: 34 [2019-01-31 16:54:18,020 INFO L226 Difference]: Without dead ends: 23 [2019-01-31 16:54:18,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-31 16:54:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-31 16:54:18,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-31 16:54:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 16:54:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-31 16:54:18,027 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-31 16:54:18,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:18,027 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-31 16:54:18,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 16:54:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-31 16:54:18,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-31 16:54:18,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:18,028 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-31 16:54:18,028 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:18,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:18,029 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-01-31 16:54:18,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:18,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:18,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:18,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:18,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:18,217 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 16:54:18,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:18,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:18,218 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:18,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:18,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:18,218 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 16:54:18,229 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:18,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:18,274 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:18,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:18,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:18,283 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 16:54:18,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:18,763 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 16:54:18,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:18,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-31 16:54:18,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:18,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 16:54:18,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 16:54:18,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-31 16:54:18,784 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-01-31 16:54:18,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:18,855 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-01-31 16:54:18,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 16:54:18,856 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-01-31 16:54:18,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:18,857 INFO L225 Difference]: With dead ends: 37 [2019-01-31 16:54:18,857 INFO L226 Difference]: Without dead ends: 25 [2019-01-31 16:54:18,858 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 16:54:18,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-31 16:54:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-31 16:54:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-31 16:54:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-31 16:54:18,863 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-01-31 16:54:18,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:18,864 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-31 16:54:18,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 16:54:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-31 16:54:18,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-31 16:54:18,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:18,865 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-31 16:54:18,865 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:18,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:18,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-01-31 16:54:18,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:18,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:18,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:18,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:18,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:19,026 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 16:54:19,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:19,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:19,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:19,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 16:54:19,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:19,028 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 16:54:19,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:19,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:19,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:19,071 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 16:54:19,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:19,602 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 16:54:19,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:19,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-31 16:54:19,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:19,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 16:54:19,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 16:54:19,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-31 16:54:19,624 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-01-31 16:54:19,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:19,680 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-31 16:54:19,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-31 16:54:19,682 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-01-31 16:54:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:19,683 INFO L225 Difference]: With dead ends: 40 [2019-01-31 16:54:19,683 INFO L226 Difference]: Without dead ends: 27 [2019-01-31 16:54:19,684 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 16:54:19,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-31 16:54:19,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-31 16:54:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-31 16:54:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-31 16:54:19,688 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-31 16:54:19,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:19,688 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-31 16:54:19,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 16:54:19,688 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-31 16:54:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-31 16:54:19,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:19,689 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-31 16:54:19,689 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:19,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:19,690 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-01-31 16:54:19,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:19,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:19,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:19,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:19,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:19,854 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 16:54:19,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:19,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:19,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:19,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:19,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:19,855 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 16:54:19,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:19,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:19,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-31 16:54:19,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:19,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:19,926 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 16:54:19,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:19,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:19,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-31 16:54:20,264 INFO L303 Elim1Store]: Index analysis took 109 ms [2019-01-31 16:54:20,319 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 16:54:20,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-31 16:54:20,424 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 16:54:20,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2019-01-31 16:54:20,428 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 16:54:20,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:21,152 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 16:54:21,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:21,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 36 [2019-01-31 16:54:21,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:21,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-31 16:54:21,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-31 16:54:21,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=711, Unknown=0, NotChecked=0, Total=1260 [2019-01-31 16:54:21,184 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 24 states. [2019-01-31 16:54:27,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:27,052 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-31 16:54:27,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-31 16:54:27,053 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-01-31 16:54:27,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:27,054 INFO L225 Difference]: With dead ends: 43 [2019-01-31 16:54:27,054 INFO L226 Difference]: Without dead ends: 29 [2019-01-31 16:54:27,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=766, Invalid=1040, Unknown=0, NotChecked=0, Total=1806 [2019-01-31 16:54:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-31 16:54:27,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-31 16:54:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-31 16:54:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-31 16:54:27,061 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-01-31 16:54:27,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:27,061 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-31 16:54:27,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-31 16:54:27,061 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-31 16:54:27,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-31 16:54:27,062 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:27,062 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-31 16:54:27,062 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:27,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:27,063 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-01-31 16:54:27,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:27,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:27,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:27,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:27,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:27,222 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 16:54:27,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:27,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:27,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:27,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:27,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:27,224 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 16:54:27,242 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:27,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:27,285 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:27,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:27,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:27,293 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 16:54:27,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:27,619 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 16:54:27,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:27,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-31 16:54:27,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:27,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-31 16:54:27,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-31 16:54:27,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-31 16:54:27,643 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-01-31 16:54:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:27,757 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-01-31 16:54:27,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-31 16:54:27,757 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-01-31 16:54:27,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:27,758 INFO L225 Difference]: With dead ends: 46 [2019-01-31 16:54:27,758 INFO L226 Difference]: Without dead ends: 31 [2019-01-31 16:54:27,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-31 16:54:27,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-31 16:54:27,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-31 16:54:27,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 16:54:27,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-31 16:54:27,763 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-31 16:54:27,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:27,763 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-31 16:54:27,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-31 16:54:27,764 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-31 16:54:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-31 16:54:27,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:27,765 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-31 16:54:27,765 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:27,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:27,765 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-01-31 16:54:27,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:27,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:27,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:27,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:27,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:28,021 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 16:54:28,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:28,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:28,022 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:28,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:28,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:28,023 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 16:54:28,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:28,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:28,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:28,068 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 16:54:28,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:28,607 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 16:54:28,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:28,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-31 16:54:28,627 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:28,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-31 16:54:28,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-31 16:54:28,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-31 16:54:28,628 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-01-31 16:54:28,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:28,694 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-01-31 16:54:28,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-31 16:54:28,695 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-31 16:54:28,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:28,696 INFO L225 Difference]: With dead ends: 49 [2019-01-31 16:54:28,696 INFO L226 Difference]: Without dead ends: 33 [2019-01-31 16:54:28,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-31 16:54:28,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-31 16:54:28,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-31 16:54:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-31 16:54:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-31 16:54:28,703 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-01-31 16:54:28,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:28,703 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-31 16:54:28,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-31 16:54:28,704 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-31 16:54:28,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-31 16:54:28,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:28,705 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-31 16:54:28,705 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:28,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:28,705 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-01-31 16:54:28,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:28,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:28,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:28,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:28,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:28,928 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 16:54:28,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:28,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:28,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:28,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:28,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:28,929 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 16:54:28,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:28,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:28,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-31 16:54:28,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:28,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:28,993 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 16:54:28,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:29,309 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 16:54:29,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:29,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 32 [2019-01-31 16:54:29,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:29,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-31 16:54:29,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-31 16:54:29,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-31 16:54:29,330 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-01-31 16:54:29,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:29,430 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-01-31 16:54:29,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-31 16:54:29,431 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-01-31 16:54:29,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:29,432 INFO L225 Difference]: With dead ends: 52 [2019-01-31 16:54:29,432 INFO L226 Difference]: Without dead ends: 35 [2019-01-31 16:54:29,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-31 16:54:29,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-31 16:54:29,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-31 16:54:29,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-31 16:54:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-31 16:54:29,437 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-31 16:54:29,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:29,437 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-31 16:54:29,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-31 16:54:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-31 16:54:29,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-31 16:54:29,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:29,439 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-31 16:54:29,439 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:29,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:29,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-01-31 16:54:29,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:29,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:29,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:29,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:29,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:29,663 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 16:54:29,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:29,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:29,663 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:29,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:29,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:29,664 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 16:54:29,672 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:29,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:29,695 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:29,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:29,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:29,707 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 16:54:29,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:30,545 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 16:54:30,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:30,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-31 16:54:30,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:30,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-31 16:54:30,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-31 16:54:30,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-31 16:54:30,566 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-01-31 16:54:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:30,677 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-31 16:54:30,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-31 16:54:30,678 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-01-31 16:54:30,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:30,679 INFO L225 Difference]: With dead ends: 55 [2019-01-31 16:54:30,679 INFO L226 Difference]: Without dead ends: 37 [2019-01-31 16:54:30,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-31 16:54:30,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-31 16:54:30,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-31 16:54:30,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-31 16:54:30,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-31 16:54:30,685 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-01-31 16:54:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:30,685 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-31 16:54:30,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-31 16:54:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-31 16:54:30,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-31 16:54:30,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:30,686 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-31 16:54:30,687 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:30,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:30,687 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-01-31 16:54:30,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:30,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:30,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:30,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:30,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:30,906 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 16:54:30,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:30,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:30,907 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:30,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:30,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:30,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:54:30,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:30,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:30,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:30,962 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 16:54:30,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:31,807 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 16:54:31,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:31,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-31 16:54:31,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:31,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-31 16:54:31,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-31 16:54:31,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-31 16:54:31,828 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-01-31 16:54:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:31,892 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-01-31 16:54:31,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-31 16:54:31,893 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-01-31 16:54:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:31,893 INFO L225 Difference]: With dead ends: 58 [2019-01-31 16:54:31,894 INFO L226 Difference]: Without dead ends: 39 [2019-01-31 16:54:31,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-31 16:54:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-31 16:54:31,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-31 16:54:31,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-31 16:54:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-31 16:54:31,899 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-31 16:54:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:31,900 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-31 16:54:31,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-31 16:54:31,900 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-31 16:54:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-31 16:54:31,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:31,901 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-31 16:54:31,901 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:31,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:31,901 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-01-31 16:54:31,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:31,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:31,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:31,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:31,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:32,752 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 16:54:32,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:32,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:32,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:32,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:32,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:32,753 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 16:54:32,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:32,765 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:32,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-31 16:54:32,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:32,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:32,842 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 16:54:32,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:33,381 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 16:54:33,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:33,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-31 16:54:33,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:33,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-31 16:54:33,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-31 16:54:33,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 16:54:33,404 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-01-31 16:54:33,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:33,672 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-01-31 16:54:33,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-31 16:54:33,673 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-01-31 16:54:33,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:33,673 INFO L225 Difference]: With dead ends: 61 [2019-01-31 16:54:33,673 INFO L226 Difference]: Without dead ends: 41 [2019-01-31 16:54:33,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 16:54:33,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-31 16:54:33,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-31 16:54:33,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-31 16:54:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-31 16:54:33,679 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-01-31 16:54:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:33,679 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-31 16:54:33,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-31 16:54:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-31 16:54:33,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-31 16:54:33,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:33,680 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-31 16:54:33,680 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:33,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:33,681 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-01-31 16:54:33,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:33,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:33,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:33,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:33,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:33,994 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 16:54:33,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:33,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:33,995 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:33,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:33,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:33,995 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 16:54:34,004 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:34,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:34,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:34,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:34,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:34,041 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 16:54:34,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:34,441 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 16:54:34,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:34,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-31 16:54:34,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:34,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-31 16:54:34,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-31 16:54:34,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-31 16:54:34,464 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-01-31 16:54:34,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:34,617 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-01-31 16:54:34,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-31 16:54:34,617 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-01-31 16:54:34,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:34,618 INFO L225 Difference]: With dead ends: 64 [2019-01-31 16:54:34,618 INFO L226 Difference]: Without dead ends: 43 [2019-01-31 16:54:34,619 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 16:54:34,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-31 16:54:34,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-31 16:54:34,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-31 16:54:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-31 16:54:34,624 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-31 16:54:34,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:34,625 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-31 16:54:34,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-31 16:54:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-31 16:54:34,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-31 16:54:34,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:34,626 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-31 16:54:34,626 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:34,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:34,626 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-01-31 16:54:34,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:34,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:34,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:34,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:34,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:35,344 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 16:54:35,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:35,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:35,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:35,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 16:54:35,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:35,345 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 16:54:35,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:35,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:35,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:35,389 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 16:54:35,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:35,924 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 16:54:35,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:35,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-31 16:54:35,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:35,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-31 16:54:35,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-31 16:54:35,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-31 16:54:35,945 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-01-31 16:54:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:36,018 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-31 16:54:36,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-31 16:54:36,018 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-01-31 16:54:36,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:36,019 INFO L225 Difference]: With dead ends: 67 [2019-01-31 16:54:36,019 INFO L226 Difference]: Without dead ends: 45 [2019-01-31 16:54:36,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-31 16:54:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-31 16:54:36,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-31 16:54:36,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-31 16:54:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-31 16:54:36,028 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-01-31 16:54:36,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:36,028 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-31 16:54:36,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-31 16:54:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-31 16:54:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-31 16:54:36,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:36,029 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-31 16:54:36,029 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:36,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:36,030 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-01-31 16:54:36,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:36,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:36,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:36,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:36,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:36,812 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 16:54:36,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:36,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:36,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:36,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:36,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:36,813 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 16:54:36,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:36,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:36,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-31 16:54:36,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:36,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:36,930 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 16:54:36,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:37,502 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 16:54:37,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:37,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-31 16:54:37,522 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:37,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-31 16:54:37,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-31 16:54:37,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-31 16:54:37,523 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-01-31 16:54:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:37,605 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-31 16:54:37,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-31 16:54:37,606 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-31 16:54:37,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:37,607 INFO L225 Difference]: With dead ends: 70 [2019-01-31 16:54:37,607 INFO L226 Difference]: Without dead ends: 47 [2019-01-31 16:54:37,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-31 16:54:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-31 16:54:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-31 16:54:37,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-31 16:54:37,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-31 16:54:37,612 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-31 16:54:37,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:37,612 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-31 16:54:37,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-31 16:54:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-31 16:54:37,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-31 16:54:37,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:37,613 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-31 16:54:37,614 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:37,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:37,614 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-01-31 16:54:37,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:37,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:37,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:37,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:37,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:38,144 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 16:54:38,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:38,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:38,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:38,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 16:54:38,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:38,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 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 16:54:38,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:38,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:38,196 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:38,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:38,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:38,206 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 16:54:38,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:38,813 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 16:54:38,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:38,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-31 16:54:38,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:38,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-31 16:54:38,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-31 16:54:38,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-31 16:54:38,834 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-01-31 16:54:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:38,922 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-01-31 16:54:38,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-31 16:54:38,923 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-01-31 16:54:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:38,924 INFO L225 Difference]: With dead ends: 73 [2019-01-31 16:54:38,924 INFO L226 Difference]: Without dead ends: 49 [2019-01-31 16:54:38,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-31 16:54:38,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-31 16:54:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-31 16:54:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-31 16:54:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-31 16:54:38,929 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-01-31 16:54:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:38,929 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-31 16:54:38,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-31 16:54:38,930 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-31 16:54:38,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-31 16:54:38,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:38,930 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-31 16:54:38,930 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:38,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:38,930 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-01-31 16:54:38,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:38,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:38,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:38,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:38,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:39,263 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 16:54:39,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:39,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:39,264 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:39,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:39,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:39,264 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 16:54:39,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:39,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:39,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:39,313 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 16:54:39,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:39,897 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 16:54:39,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:39,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-31 16:54:39,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:39,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-31 16:54:39,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-31 16:54:39,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-31 16:54:39,918 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-01-31 16:54:40,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:40,004 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-01-31 16:54:40,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-31 16:54:40,004 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-01-31 16:54:40,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:40,005 INFO L225 Difference]: With dead ends: 76 [2019-01-31 16:54:40,005 INFO L226 Difference]: Without dead ends: 51 [2019-01-31 16:54:40,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-31 16:54:40,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-31 16:54:40,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-31 16:54:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-31 16:54:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-31 16:54:40,010 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-31 16:54:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:40,011 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-31 16:54:40,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-31 16:54:40,011 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-31 16:54:40,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-31 16:54:40,011 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:40,012 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-31 16:54:40,012 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:40,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:40,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-01-31 16:54:40,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:40,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:40,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:40,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:40,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:40,479 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 16:54:40,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:40,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:40,480 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:40,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:40,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:40,480 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 16:54:40,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:40,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:40,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-31 16:54:40,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:40,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:40,671 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 16:54:40,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:41,849 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 16:54:41,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:41,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 50 [2019-01-31 16:54:41,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:41,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-31 16:54:41,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-31 16:54:41,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-31 16:54:41,881 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-01-31 16:54:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:41,956 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-01-31 16:54:41,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-31 16:54:41,957 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-01-31 16:54:41,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:41,958 INFO L225 Difference]: With dead ends: 79 [2019-01-31 16:54:41,958 INFO L226 Difference]: Without dead ends: 53 [2019-01-31 16:54:41,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-31 16:54:41,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-31 16:54:41,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-31 16:54:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-31 16:54:41,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-31 16:54:41,962 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-01-31 16:54:41,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:41,963 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-31 16:54:41,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-31 16:54:41,963 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-31 16:54:41,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-31 16:54:41,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:41,964 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-31 16:54:41,964 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:41,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:41,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-01-31 16:54:41,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:41,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:41,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:41,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:41,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:42,458 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 16:54:42,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:42,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:42,458 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:42,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:42,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:42,459 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 16:54:42,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:42,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:42,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:42,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:42,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:42,511 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 16:54:42,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:43,598 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 16:54:43,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:43,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-31 16:54:43,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:43,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-31 16:54:43,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-31 16:54:43,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-31 16:54:43,618 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-01-31 16:54:43,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:43,761 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-01-31 16:54:43,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-31 16:54:43,762 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-01-31 16:54:43,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:43,762 INFO L225 Difference]: With dead ends: 82 [2019-01-31 16:54:43,763 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 16:54:43,764 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 16:54:43,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 16:54:43,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-31 16:54:43,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-31 16:54:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-31 16:54:43,769 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-31 16:54:43,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:43,769 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-31 16:54:43,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-31 16:54:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-31 16:54:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-31 16:54:43,772 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:43,772 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-31 16:54:43,773 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:43,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:43,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-01-31 16:54:43,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:43,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:43,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:43,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:43,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:44,325 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 16:54:44,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:44,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:44,325 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:44,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:44,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:44,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:54:44,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:44,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:44,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:44,380 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 16:54:44,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:45,175 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 16:54:45,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:45,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-31 16:54:45,194 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:45,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-31 16:54:45,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-31 16:54:45,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-31 16:54:45,196 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-01-31 16:54:45,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:45,307 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-01-31 16:54:45,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-31 16:54:45,308 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-01-31 16:54:45,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:45,308 INFO L225 Difference]: With dead ends: 85 [2019-01-31 16:54:45,309 INFO L226 Difference]: Without dead ends: 57 [2019-01-31 16:54:45,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-31 16:54:45,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-31 16:54:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-31 16:54:45,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-31 16:54:45,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-31 16:54:45,323 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-01-31 16:54:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:45,323 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-31 16:54:45,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-31 16:54:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-31 16:54:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-31 16:54:45,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:45,324 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-31 16:54:45,324 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:45,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:45,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-01-31 16:54:45,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:45,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:45,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:45,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:45,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:45,726 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 16:54:45,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:45,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:45,727 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:45,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:45,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:45,727 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 16:54:45,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:45,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:45,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-31 16:54:45,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:45,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:45,903 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 16:54:45,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:46,707 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 16:54:46,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:46,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 29] total 56 [2019-01-31 16:54:46,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:46,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-31 16:54:46,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-31 16:54:46,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-31 16:54:46,728 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-01-31 16:54:46,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:46,809 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-01-31 16:54:46,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-31 16:54:46,810 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-01-31 16:54:46,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:46,811 INFO L225 Difference]: With dead ends: 88 [2019-01-31 16:54:46,811 INFO L226 Difference]: Without dead ends: 59 [2019-01-31 16:54:46,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-31 16:54:46,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-31 16:54:46,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-31 16:54:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-31 16:54:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-31 16:54:46,815 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-31 16:54:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:46,815 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-31 16:54:46,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-31 16:54:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-31 16:54:46,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-31 16:54:46,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:46,816 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-31 16:54:46,816 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:46,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:46,817 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-01-31 16:54:46,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:46,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:46,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:46,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:46,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:47,340 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 16:54:47,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:47,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:47,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:47,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:47,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:47,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 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 16:54:47,350 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:47,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:47,389 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:47,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:47,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:47,400 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 16:54:47,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:48,599 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 16:54:48,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:48,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-31 16:54:48,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:48,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-31 16:54:48,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-31 16:54:48,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-31 16:54:48,620 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-01-31 16:54:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:48,749 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-01-31 16:54:48,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-31 16:54:48,750 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-01-31 16:54:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:48,751 INFO L225 Difference]: With dead ends: 91 [2019-01-31 16:54:48,751 INFO L226 Difference]: Without dead ends: 61 [2019-01-31 16:54:48,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-31 16:54:48,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-31 16:54:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-31 16:54:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-31 16:54:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-31 16:54:48,756 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-01-31 16:54:48,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:48,756 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-31 16:54:48,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-31 16:54:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-31 16:54:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-31 16:54:48,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:48,757 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-31 16:54:48,757 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:48,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:48,757 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-01-31 16:54:48,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:48,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:48,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:48,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:48,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:49,166 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 16:54:49,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:49,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:49,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:49,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:49,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:49,167 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 16:54:49,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:49,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:49,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:49,243 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 16:54:49,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:50,378 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 16:54:50,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:50,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-31 16:54:50,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:50,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-31 16:54:50,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-31 16:54:50,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-31 16:54:50,398 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-01-31 16:54:50,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:50,534 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-01-31 16:54:50,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-31 16:54:50,537 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-01-31 16:54:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:50,537 INFO L225 Difference]: With dead ends: 94 [2019-01-31 16:54:50,537 INFO L226 Difference]: Without dead ends: 63 [2019-01-31 16:54:50,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-31 16:54:50,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-31 16:54:50,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-31 16:54:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-31 16:54:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-31 16:54:50,541 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-31 16:54:50,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:50,541 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-31 16:54:50,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-31 16:54:50,541 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-31 16:54:50,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-31 16:54:50,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:50,542 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-31 16:54:50,542 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:50,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:50,543 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-01-31 16:54:50,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:50,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:50,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:50,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:50,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:50,958 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 16:54:50,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:50,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:50,958 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:50,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:50,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:50,959 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 16:54:50,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:50,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:51,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-31 16:54:51,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:51,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:51,179 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 16:54:51,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:52,163 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 16:54:52,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:52,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 62 [2019-01-31 16:54:52,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:52,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-31 16:54:52,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-31 16:54:52,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-31 16:54:52,186 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-01-31 16:54:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:52,257 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-01-31 16:54:52,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-31 16:54:52,258 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-01-31 16:54:52,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:52,258 INFO L225 Difference]: With dead ends: 97 [2019-01-31 16:54:52,259 INFO L226 Difference]: Without dead ends: 65 [2019-01-31 16:54:52,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-31 16:54:52,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-31 16:54:52,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-31 16:54:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-31 16:54:52,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-31 16:54:52,263 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-01-31 16:54:52,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:52,263 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-31 16:54:52,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-31 16:54:52,264 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-31 16:54:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-31 16:54:52,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:52,264 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-31 16:54:52,264 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:52,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:52,264 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-01-31 16:54:52,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:52,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:52,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:52,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:52,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:52,727 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 16:54:52,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:52,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:52,727 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:52,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:52,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:52,727 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 16:54:52,737 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:52,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:52,780 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:52,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:52,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:52,794 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 16:54:52,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:54,183 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 16:54:54,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:54,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-31 16:54:54,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:54,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-31 16:54:54,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-31 16:54:54,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-31 16:54:54,202 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-01-31 16:54:54,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:54,315 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-01-31 16:54:54,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-31 16:54:54,316 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-01-31 16:54:54,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:54,317 INFO L225 Difference]: With dead ends: 100 [2019-01-31 16:54:54,317 INFO L226 Difference]: Without dead ends: 67 [2019-01-31 16:54:54,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-31 16:54:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-31 16:54:54,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-31 16:54:54,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-31 16:54:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-31 16:54:54,322 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-31 16:54:54,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:54,322 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-31 16:54:54,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-31 16:54:54,322 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-31 16:54:54,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-31 16:54:54,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:54,323 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-31 16:54:54,323 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:54,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:54,323 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-01-31 16:54:54,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:54,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:54,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:54,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:54,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:55,402 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 16:54:55,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:55,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:55,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:55,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:55,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:55,403 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 16:54:55,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:55,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:55,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:55,474 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 16:54:55,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:56,608 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 16:54:56,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:56,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-31 16:54:56,627 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:56,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-31 16:54:56,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-31 16:54:56,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-31 16:54:56,628 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-01-31 16:54:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:56,765 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-01-31 16:54:56,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-31 16:54:56,766 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-01-31 16:54:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:56,767 INFO L225 Difference]: With dead ends: 103 [2019-01-31 16:54:56,767 INFO L226 Difference]: Without dead ends: 69 [2019-01-31 16:54:56,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-31 16:54:56,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-31 16:54:56,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-31 16:54:56,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-31 16:54:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-31 16:54:56,771 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-01-31 16:54:56,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:56,772 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-31 16:54:56,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-31 16:54:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-31 16:54:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-31 16:54:56,772 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:56,772 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-31 16:54:56,773 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:56,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:56,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-01-31 16:54:56,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:56,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:56,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:56,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:56,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:57,334 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 16:54:57,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:57,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:57,334 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:57,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:57,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:57,335 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 16:54:57,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:57,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:57,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-31 16:54:57,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:57,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:57,597 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 16:54:57,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:59,096 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 16:54:59,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:59,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-31 16:54:59,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:59,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-31 16:54:59,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-31 16:54:59,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-31 16:54:59,117 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-01-31 16:54:59,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:59,271 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-01-31 16:54:59,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-31 16:54:59,271 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-01-31 16:54:59,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:59,272 INFO L225 Difference]: With dead ends: 106 [2019-01-31 16:54:59,272 INFO L226 Difference]: Without dead ends: 71 [2019-01-31 16:54:59,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-31 16:54:59,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-31 16:54:59,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-31 16:54:59,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-31 16:54:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-31 16:54:59,276 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-31 16:54:59,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:59,276 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-31 16:54:59,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-31 16:54:59,276 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-31 16:54:59,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-31 16:54:59,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:59,277 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-31 16:54:59,277 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:59,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:59,277 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-01-31 16:54:59,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:59,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:59,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:59,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:59,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:59,979 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 16:54:59,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:59,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:59,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:59,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:59,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:59,980 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 16:54:59,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:59,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:00,032 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:00,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:00,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:00,046 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 16:55:00,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:01,354 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 16:55:01,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:01,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-31 16:55:01,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:01,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-31 16:55:01,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-31 16:55:01,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 16:55:01,374 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-01-31 16:55:01,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:01,532 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-01-31 16:55:01,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-31 16:55:01,532 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-01-31 16:55:01,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:01,533 INFO L225 Difference]: With dead ends: 109 [2019-01-31 16:55:01,534 INFO L226 Difference]: Without dead ends: 73 [2019-01-31 16:55:01,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 16:55:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-31 16:55:01,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-31 16:55:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-31 16:55:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-31 16:55:01,537 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-01-31 16:55:01,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:01,537 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-31 16:55:01,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-31 16:55:01,537 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-31 16:55:01,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-31 16:55:01,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:01,538 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-31 16:55:01,538 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:01,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:01,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-01-31 16:55:01,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:01,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:01,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:01,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:01,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:02,101 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 16:55:02,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:02,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:02,102 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:02,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:02,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:02,102 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 16:55:02,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:02,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:02,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:02,171 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 16:55:02,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:03,841 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 16:55:03,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:03,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-31 16:55:03,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:03,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-31 16:55:03,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-31 16:55:03,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-31 16:55:03,860 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-01-31 16:55:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:04,024 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-01-31 16:55:04,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-31 16:55:04,024 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-01-31 16:55:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:04,025 INFO L225 Difference]: With dead ends: 112 [2019-01-31 16:55:04,025 INFO L226 Difference]: Without dead ends: 75 [2019-01-31 16:55:04,026 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 16:55:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-31 16:55:04,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-31 16:55:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-31 16:55:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-31 16:55:04,030 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-31 16:55:04,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:04,030 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-31 16:55:04,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-31 16:55:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-31 16:55:04,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-31 16:55:04,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:04,031 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-31 16:55:04,031 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:04,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:04,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-01-31 16:55:04,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:04,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:04,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:04,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:04,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:04,668 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 16:55:04,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:04,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:04,668 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:04,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:04,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:04,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:55:04,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:04,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:05,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-31 16:55:05,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:05,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:05,103 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 16:55:05,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:06,538 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 16:55:06,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:06,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-31 16:55:06,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:06,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-31 16:55:06,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-31 16:55:06,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-31 16:55:06,560 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-01-31 16:55:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:06,704 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-01-31 16:55:06,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-31 16:55:06,704 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-01-31 16:55:06,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:06,705 INFO L225 Difference]: With dead ends: 115 [2019-01-31 16:55:06,705 INFO L226 Difference]: Without dead ends: 77 [2019-01-31 16:55:06,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-31 16:55:06,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-31 16:55:06,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-31 16:55:06,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-31 16:55:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-31 16:55:06,708 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-01-31 16:55:06,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:06,708 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-31 16:55:06,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-31 16:55:06,708 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-31 16:55:06,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-31 16:55:06,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:06,709 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-31 16:55:06,709 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:06,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:06,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-01-31 16:55:06,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:06,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:06,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:06,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:06,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:07,477 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 16:55:07,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:07,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:07,478 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:07,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:07,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:07,478 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 16:55:07,492 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:07,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:07,538 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:07,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:07,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:07,551 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 16:55:07,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:09,516 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 16:55:09,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:09,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-31 16:55:09,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:09,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-31 16:55:09,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-31 16:55:09,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-31 16:55:09,536 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-01-31 16:55:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:09,679 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-01-31 16:55:09,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-31 16:55:09,680 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-01-31 16:55:09,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:09,680 INFO L225 Difference]: With dead ends: 118 [2019-01-31 16:55:09,680 INFO L226 Difference]: Without dead ends: 79 [2019-01-31 16:55:09,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-31 16:55:09,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-31 16:55:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-31 16:55:09,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-31 16:55:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-31 16:55:09,685 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-31 16:55:09,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:09,686 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-31 16:55:09,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-31 16:55:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-31 16:55:09,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-31 16:55:09,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:09,686 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-31 16:55:09,687 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:09,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:09,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-01-31 16:55:09,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:09,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:09,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:09,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:09,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:10,289 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 16:55:10,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:10,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:10,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:10,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:10,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:10,291 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 16:55:10,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:10,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:10,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:10,363 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 16:55:10,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:11,904 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 16:55:11,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:11,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-31 16:55:11,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:11,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-31 16:55:11,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-31 16:55:11,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-31 16:55:11,924 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-01-31 16:55:12,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:12,055 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-01-31 16:55:12,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-31 16:55:12,055 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-01-31 16:55:12,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:12,056 INFO L225 Difference]: With dead ends: 121 [2019-01-31 16:55:12,056 INFO L226 Difference]: Without dead ends: 81 [2019-01-31 16:55:12,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-31 16:55:12,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-31 16:55:12,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-31 16:55:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-31 16:55:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-31 16:55:12,060 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-01-31 16:55:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:12,060 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-31 16:55:12,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-31 16:55:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-31 16:55:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-31 16:55:12,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:12,061 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-31 16:55:12,061 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:12,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:12,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-01-31 16:55:12,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:12,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:12,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:12,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:12,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:12,716 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 16:55:12,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:12,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:12,716 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:12,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:12,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:12,717 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 16:55:12,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:12,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:13,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-31 16:55:13,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:13,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:13,250 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 16:55:13,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:15,165 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 16:55:15,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:15,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-31 16:55:15,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:15,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-31 16:55:15,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-31 16:55:15,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-31 16:55:15,186 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-01-31 16:55:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:15,353 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-01-31 16:55:15,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-31 16:55:15,353 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-01-31 16:55:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:15,354 INFO L225 Difference]: With dead ends: 124 [2019-01-31 16:55:15,354 INFO L226 Difference]: Without dead ends: 83 [2019-01-31 16:55:15,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-31 16:55:15,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-31 16:55:15,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-31 16:55:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-31 16:55:15,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-31 16:55:15,357 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-31 16:55:15,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:15,357 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-31 16:55:15,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-31 16:55:15,358 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-31 16:55:15,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-31 16:55:15,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:15,358 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-31 16:55:15,358 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:15,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:15,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-01-31 16:55:15,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:15,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:15,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:15,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:15,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:16,076 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 16:55:16,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:16,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:16,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:16,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:16,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:16,076 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 16:55:16,085 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:16,085 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:16,142 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:16,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:16,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:16,153 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 16:55:16,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:17,924 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 16:55:17,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:17,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-31 16:55:17,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:17,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-31 16:55:17,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-31 16:55:17,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-31 16:55:17,945 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-01-31 16:55:18,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:18,099 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-01-31 16:55:18,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-31 16:55:18,100 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-01-31 16:55:18,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:18,101 INFO L225 Difference]: With dead ends: 127 [2019-01-31 16:55:18,101 INFO L226 Difference]: Without dead ends: 85 [2019-01-31 16:55:18,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-31 16:55:18,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-31 16:55:18,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-31 16:55:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-31 16:55:18,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-31 16:55:18,106 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-01-31 16:55:18,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:18,106 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-31 16:55:18,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-31 16:55:18,106 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-31 16:55:18,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-31 16:55:18,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:18,107 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-31 16:55:18,107 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:18,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:18,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-01-31 16:55:18,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:18,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:18,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:18,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:18,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:19,071 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 16:55:19,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:19,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:19,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:19,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:19,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:19,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:55:19,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:19,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:19,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:19,146 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 16:55:19,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:20,969 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 16:55:20,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:20,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-31 16:55:20,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:20,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-31 16:55:20,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-31 16:55:20,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-31 16:55:20,989 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-01-31 16:55:21,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:21,140 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-01-31 16:55:21,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-31 16:55:21,141 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-01-31 16:55:21,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:21,142 INFO L225 Difference]: With dead ends: 130 [2019-01-31 16:55:21,142 INFO L226 Difference]: Without dead ends: 87 [2019-01-31 16:55:21,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-31 16:55:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-31 16:55:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-31 16:55:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-31 16:55:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-31 16:55:21,147 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-31 16:55:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:21,148 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-31 16:55:21,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-31 16:55:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-31 16:55:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-31 16:55:21,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:21,149 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-31 16:55:21,149 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:21,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:21,149 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-01-31 16:55:21,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:21,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:21,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:21,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:21,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:21,972 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 16:55:21,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:21,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:21,973 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:21,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:21,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:21,973 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 16:55:21,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:21,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:22,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-31 16:55:22,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:22,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:22,628 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 16:55:22,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:24,786 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 16:55:24,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:24,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-31 16:55:24,806 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:24,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-31 16:55:24,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-31 16:55:24,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-31 16:55:24,807 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-01-31 16:55:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:24,950 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-01-31 16:55:24,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-31 16:55:24,950 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-01-31 16:55:24,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:24,951 INFO L225 Difference]: With dead ends: 133 [2019-01-31 16:55:24,951 INFO L226 Difference]: Without dead ends: 89 [2019-01-31 16:55:24,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-31 16:55:24,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-31 16:55:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-31 16:55:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-31 16:55:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-31 16:55:24,957 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-01-31 16:55:24,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:24,957 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-31 16:55:24,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-31 16:55:24,957 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-31 16:55:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-31 16:55:24,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:24,958 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-31 16:55:24,958 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:24,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:24,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-01-31 16:55:24,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:24,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:24,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:24,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:24,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:25,873 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 16:55:25,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:25,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:25,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:25,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 16:55:25,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:25,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:55:25,883 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:25,884 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:25,942 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:25,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:25,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:25,957 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 16:55:25,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:27,969 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 16:55:27,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:27,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-31 16:55:27,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:27,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-31 16:55:27,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-31 16:55:27,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-31 16:55:27,989 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-01-31 16:55:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:28,139 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-01-31 16:55:28,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-31 16:55:28,139 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-01-31 16:55:28,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:28,140 INFO L225 Difference]: With dead ends: 136 [2019-01-31 16:55:28,140 INFO L226 Difference]: Without dead ends: 91 [2019-01-31 16:55:28,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-31 16:55:28,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-31 16:55:28,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-31 16:55:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-31 16:55:28,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-31 16:55:28,145 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-31 16:55:28,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:28,145 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-31 16:55:28,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-31 16:55:28,146 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-31 16:55:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-31 16:55:28,146 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:28,146 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-31 16:55:28,147 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:28,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:28,147 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-01-31 16:55:28,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:28,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:28,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:28,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:28,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:29,907 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 16:55:29,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:29,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:29,907 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:29,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:29,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:29,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:55:29,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:29,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:29,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:29,986 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 16:55:29,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:32,063 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 16:55:32,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:32,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-31 16:55:32,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:32,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-31 16:55:32,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-31 16:55:32,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-31 16:55:32,095 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-01-31 16:55:32,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:32,699 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-01-31 16:55:32,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-31 16:55:32,699 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-01-31 16:55:32,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:32,700 INFO L225 Difference]: With dead ends: 139 [2019-01-31 16:55:32,700 INFO L226 Difference]: Without dead ends: 93 [2019-01-31 16:55:32,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-31 16:55:32,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-31 16:55:32,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-31 16:55:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-31 16:55:32,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-31 16:55:32,705 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-01-31 16:55:32,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:32,705 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-31 16:55:32,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-31 16:55:32,705 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-31 16:55:32,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-31 16:55:32,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:32,705 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-31 16:55:32,706 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:32,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:32,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-01-31 16:55:32,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:32,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:32,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:32,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:32,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:33,613 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 16:55:33,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:33,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:33,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:33,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:33,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:33,614 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 16:55:33,622 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:33,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:34,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-31 16:55:34,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:34,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:34,393 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 16:55:34,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:36,535 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 16:55:36,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:36,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47, 47] total 92 [2019-01-31 16:55:36,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:36,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-31 16:55:36,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-31 16:55:36,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-31 16:55:36,557 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-01-31 16:55:37,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:37,495 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-01-31 16:55:37,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-31 16:55:37,495 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-01-31 16:55:37,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:37,496 INFO L225 Difference]: With dead ends: 142 [2019-01-31 16:55:37,496 INFO L226 Difference]: Without dead ends: 95 [2019-01-31 16:55:37,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-31 16:55:37,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-31 16:55:37,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-31 16:55:37,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-31 16:55:37,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-31 16:55:37,502 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-31 16:55:37,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:37,502 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-31 16:55:37,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-31 16:55:37,502 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-31 16:55:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-31 16:55:37,503 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:37,503 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-31 16:55:37,503 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:37,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:37,503 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-01-31 16:55:37,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:37,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:37,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:37,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:37,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:38,575 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 16:55:38,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:38,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:38,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:38,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:38,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:38,576 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 16:55:38,594 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:38,595 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:38,675 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:38,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:38,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:38,695 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 16:55:38,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:41,943 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 16:55:41,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:41,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-31 16:55:41,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:41,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-31 16:55:41,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-31 16:55:41,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 16:55:41,963 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-01-31 16:55:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:42,151 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-01-31 16:55:42,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-31 16:55:42,152 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-01-31 16:55:42,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:42,153 INFO L225 Difference]: With dead ends: 145 [2019-01-31 16:55:42,153 INFO L226 Difference]: Without dead ends: 97 [2019-01-31 16:55:42,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 16:55:42,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-31 16:55:42,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-31 16:55:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-31 16:55:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-31 16:55:42,157 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-01-31 16:55:42,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:42,157 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-31 16:55:42,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-31 16:55:42,158 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-31 16:55:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-31 16:55:42,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:42,158 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-31 16:55:42,158 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:42,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:42,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-01-31 16:55:42,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:42,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:42,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:42,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:42,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:43,157 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 16:55:43,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:43,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:43,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:43,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:43,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:43,157 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 16:55:43,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:43,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:43,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:43,240 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 16:55:43,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:45,867 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 16:55:45,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:45,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-31 16:55:45,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:45,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-31 16:55:45,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-31 16:55:45,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-31 16:55:45,888 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-01-31 16:55:46,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:46,157 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-01-31 16:55:46,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-31 16:55:46,158 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-01-31 16:55:46,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:46,159 INFO L225 Difference]: With dead ends: 148 [2019-01-31 16:55:46,159 INFO L226 Difference]: Without dead ends: 99 [2019-01-31 16:55:46,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-31 16:55:46,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-31 16:55:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-31 16:55:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-31 16:55:46,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-31 16:55:46,162 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-31 16:55:46,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:46,163 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-31 16:55:46,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-31 16:55:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-31 16:55:46,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-31 16:55:46,163 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:46,163 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-31 16:55:46,163 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:46,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:46,164 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-01-31 16:55:46,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:46,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:46,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:46,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:46,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:47,192 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 16:55:47,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:47,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:47,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:47,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:47,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:47,193 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 16:55:47,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:47,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:48,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-31 16:55:48,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:48,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:48,903 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 16:55:48,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:51,937 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 16:55:51,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:51,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-31 16:55:51,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:51,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-31 16:55:51,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-31 16:55:51,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-31 16:55:51,959 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-01-31 16:55:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:52,339 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-01-31 16:55:52,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-31 16:55:52,339 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-01-31 16:55:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:52,340 INFO L225 Difference]: With dead ends: 151 [2019-01-31 16:55:52,340 INFO L226 Difference]: Without dead ends: 101 [2019-01-31 16:55:52,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-31 16:55:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-31 16:55:52,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-31 16:55:52,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-31 16:55:52,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-31 16:55:52,344 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-01-31 16:55:52,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:52,345 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-31 16:55:52,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-31 16:55:52,345 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-31 16:55:52,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-31 16:55:52,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:52,345 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-31 16:55:52,345 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:52,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:52,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-01-31 16:55:52,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:52,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:52,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:52,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:52,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:54,014 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 16:55:54,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:54,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:54,015 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:54,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:54,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:54,015 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 16:55:54,023 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:54,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:54,106 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:54,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:54,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:54,122 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 16:55:54,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:56,961 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 16:55:56,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:56,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-31 16:55:56,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:56,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-31 16:55:56,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-31 16:55:56,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-31 16:55:56,981 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-01-31 16:55:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:57,191 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-01-31 16:55:57,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-31 16:55:57,191 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-01-31 16:55:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:57,192 INFO L225 Difference]: With dead ends: 154 [2019-01-31 16:55:57,192 INFO L226 Difference]: Without dead ends: 103 [2019-01-31 16:55:57,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-31 16:55:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-31 16:55:57,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-31 16:55:57,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-31 16:55:57,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-31 16:55:57,197 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-31 16:55:57,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:57,198 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-31 16:55:57,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-31 16:55:57,198 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-31 16:55:57,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-31 16:55:57,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:57,198 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-31 16:55:57,198 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:57,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:57,199 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-01-31 16:55:57,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:57,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:57,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:57,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:57,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:58,880 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 16:55:58,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:58,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:58,881 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:58,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:58,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:58,881 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 16:55:58,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:58,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:58,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:58,970 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 16:55:58,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:01,941 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 16:56:01,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:01,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-31 16:56:01,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:01,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-31 16:56:01,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-31 16:56:01,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-31 16:56:01,961 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-01-31 16:56:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:02,195 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-01-31 16:56:02,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-31 16:56:02,195 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-01-31 16:56:02,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:02,196 INFO L225 Difference]: With dead ends: 157 [2019-01-31 16:56:02,196 INFO L226 Difference]: Without dead ends: 105 [2019-01-31 16:56:02,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-31 16:56:02,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-31 16:56:02,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-31 16:56:02,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-31 16:56:02,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-31 16:56:02,200 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-01-31 16:56:02,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:02,201 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-31 16:56:02,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-31 16:56:02,201 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-31 16:56:02,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-31 16:56:02,201 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:02,202 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-31 16:56:02,202 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:02,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:02,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-01-31 16:56:02,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:02,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:02,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:02,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:02,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:03,998 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 16:56:03,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:03,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:03,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:03,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:03,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:03,999 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 16:56:04,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:56:04,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:56:05,060 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-31 16:56:05,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:05,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:05,085 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 16:56:05,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:07,870 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 16:56:07,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:07,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-31 16:56:07,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:07,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-31 16:56:07,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-31 16:56:07,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-31 16:56:07,893 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-01-31 16:56:08,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:08,237 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-01-31 16:56:08,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-31 16:56:08,237 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-01-31 16:56:08,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:08,239 INFO L225 Difference]: With dead ends: 160 [2019-01-31 16:56:08,239 INFO L226 Difference]: Without dead ends: 107 [2019-01-31 16:56:08,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-31 16:56:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-31 16:56:08,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-31 16:56:08,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-31 16:56:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-31 16:56:08,245 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-31 16:56:08,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:08,246 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-31 16:56:08,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-31 16:56:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-31 16:56:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-31 16:56:08,247 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:08,247 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-31 16:56:08,247 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:08,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:08,248 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-01-31 16:56:08,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:08,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:08,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:08,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:08,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:10,456 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 16:56:10,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:10,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:10,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:10,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:10,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:10,457 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 16:56:10,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:56:10,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:56:10,534 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:56:10,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:10,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:10,550 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 16:56:10,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:13,373 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 16:56:13,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:13,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-31 16:56:13,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:13,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-31 16:56:13,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-31 16:56:13,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-31 16:56:13,394 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-01-31 16:56:13,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:13,667 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-01-31 16:56:13,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-31 16:56:13,667 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-01-31 16:56:13,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:13,668 INFO L225 Difference]: With dead ends: 163 [2019-01-31 16:56:13,668 INFO L226 Difference]: Without dead ends: 109 [2019-01-31 16:56:13,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-31 16:56:13,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-31 16:56:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-31 16:56:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-31 16:56:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-01-31 16:56:13,673 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-01-31 16:56:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:13,673 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-01-31 16:56:13,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-31 16:56:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-01-31 16:56:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-31 16:56:13,674 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:13,674 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-01-31 16:56:13,674 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:13,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:13,675 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-01-31 16:56:13,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:13,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:13,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:13,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:13,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:15,304 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 16:56:15,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:15,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:15,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:15,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:15,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:15,305 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 16:56:15,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:15,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:56:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:15,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:15,398 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 16:56:15,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:18,401 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 16:56:18,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:18,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-31 16:56:18,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:18,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-31 16:56:18,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-31 16:56:18,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-31 16:56:18,422 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-01-31 16:56:18,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:18,701 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-01-31 16:56:18,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-31 16:56:18,702 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-01-31 16:56:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:18,703 INFO L225 Difference]: With dead ends: 166 [2019-01-31 16:56:18,703 INFO L226 Difference]: Without dead ends: 111 [2019-01-31 16:56:18,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-31 16:56:18,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-31 16:56:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-31 16:56:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-31 16:56:18,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-01-31 16:56:18,707 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-01-31 16:56:18,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:18,707 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-01-31 16:56:18,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-31 16:56:18,707 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-01-31 16:56:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-31 16:56:18,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:18,708 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-01-31 16:56:18,708 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:18,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:18,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-01-31 16:56:18,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:18,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:18,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:18,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:18,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:19,941 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 16:56:19,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:19,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:19,941 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:19,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:19,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:19,942 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 16:56:19,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:56:19,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:56:21,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-31 16:56:21,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:21,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:21,474 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 16:56:21,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:21,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:21,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-31 16:58:26,343 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000) stderr output: (error "out of memory") [2019-01-31 16:58:26,544 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:58:26,545 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 16:58:26,550 INFO L168 Benchmark]: Toolchain (without parser) took 254167.29 ms. Allocated memory was 134.7 MB in the beginning and 633.3 MB in the end (delta: 498.6 MB). Free memory was 106.5 MB in the beginning and 234.2 MB in the end (delta: -127.7 MB). Peak memory consumption was 370.9 MB. Max. memory is 7.1 GB. [2019-01-31 16:58:26,552 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 134.7 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 16:58:26,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.87 ms. Allocated memory is still 134.7 MB. Free memory was 106.3 MB in the beginning and 104.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-01-31 16:58:26,553 INFO L168 Benchmark]: Boogie Preprocessor took 16.08 ms. Allocated memory is still 134.7 MB. Free memory was 104.5 MB in the beginning and 103.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. [2019-01-31 16:58:26,553 INFO L168 Benchmark]: RCFGBuilder took 281.65 ms. Allocated memory is still 134.7 MB. Free memory was 103.5 MB in the beginning and 94.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-01-31 16:58:26,554 INFO L168 Benchmark]: TraceAbstraction took 253825.46 ms. Allocated memory was 134.7 MB in the beginning and 633.3 MB in the end (delta: 498.6 MB). Free memory was 94.0 MB in the beginning and 234.2 MB in the end (delta: -140.2 MB). Peak memory consumption was 358.4 MB. Max. memory is 7.1 GB. [2019-01-31 16:58:26,557 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.19 ms. Allocated memory is still 134.7 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.87 ms. Allocated memory is still 134.7 MB. Free memory was 106.3 MB in the beginning and 104.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 16.08 ms. Allocated memory is still 134.7 MB. Free memory was 104.5 MB in the beginning and 103.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 281.65 ms. Allocated memory is still 134.7 MB. Free memory was 103.5 MB in the beginning and 94.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253825.46 ms. Allocated memory was 134.7 MB in the beginning and 633.3 MB in the end (delta: 498.6 MB). Free memory was 94.0 MB in the beginning and 234.2 MB in the end (delta: -140.2 MB). Peak memory consumption was 358.4 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...