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/s3_clnt_2.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:41:03,040 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:41:03,043 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:41:03,056 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:41:03,057 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:41:03,058 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:41:03,060 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:41:03,062 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:41:03,065 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:41:03,066 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:41:03,068 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:41:03,069 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:41:03,070 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:41:03,071 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:41:03,081 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:41:03,082 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:41:03,082 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:41:03,084 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:41:03,086 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:41:03,088 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:41:03,089 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:41:03,090 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:41:03,092 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:41:03,093 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:41:03,093 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:41:03,094 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:41:03,095 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:41:03,096 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:41:03,096 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:41:03,097 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:41:03,098 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:41:03,098 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:41:03,099 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:41:03,099 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:41:03,100 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:41:03,100 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:41:03,101 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 [2018-12-03 15:41:03,114 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:41:03,115 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:41:03,115 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:41:03,116 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:41:03,117 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:41:03,117 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:41:03,117 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:41:03,117 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:41:03,117 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:41:03,118 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:41:03,118 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:41:03,118 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:41:03,118 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:41:03,119 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:41:03,119 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:41:03,121 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:41:03,121 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:41:03,121 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:41:03,122 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:41:03,122 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:41:03,122 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:41:03,122 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:41:03,122 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:41:03,124 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:41:03,124 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:41:03,124 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:41:03,124 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:41:03,125 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:41:03,125 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:41:03,125 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:41:03,125 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:41:03,125 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:41:03,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:41:03,126 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:41:03,126 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:41:03,126 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:41:03,126 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:41:03,127 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:41:03,127 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:41:03,127 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:41:03,127 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:41:03,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:41:03,197 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:41:03,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:41:03,206 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:41:03,207 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:41:03,208 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl [2018-12-03 15:41:03,208 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl' [2018-12-03 15:41:03,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:41:03,314 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:41:03,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:03,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:41:03,315 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:41:03,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:03" (1/1) ... [2018-12-03 15:41:03,349 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:03" (1/1) ... [2018-12-03 15:41:03,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:03,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:41:03,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:41:03,362 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:41:03,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:03" (1/1) ... [2018-12-03 15:41:03,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:03" (1/1) ... [2018-12-03 15:41:03,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:03" (1/1) ... [2018-12-03 15:41:03,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:03" (1/1) ... [2018-12-03 15:41:03,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:03" (1/1) ... [2018-12-03 15:41:03,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:03" (1/1) ... [2018-12-03 15:41:03,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:03" (1/1) ... [2018-12-03 15:41:03,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:41:03,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:41:03,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:41:03,427 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:41:03,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:41:03,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:41:03,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:41:04,123 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:41:04,123 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:41:04,124 INFO L202 PluginConnector]: Adding new model s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:04 BoogieIcfgContainer [2018-12-03 15:41:04,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:41:04,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:41:04,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:41:04,129 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:41:04,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:03" (1/2) ... [2018-12-03 15:41:04,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510bf597 and model type s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:41:04, skipping insertion in model container [2018-12-03 15:41:04,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:04" (2/2) ... [2018-12-03 15:41:04,135 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil.c_21.bpl [2018-12-03 15:41:04,145 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:41:04,155 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:41:04,175 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:41:04,220 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:41:04,220 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:41:04,220 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:41:04,221 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:41:04,221 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:41:04,221 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:41:04,221 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:41:04,221 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:41:04,240 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-12-03 15:41:04,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:41:04,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:04,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:04,257 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:04,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:04,264 INFO L82 PathProgramCache]: Analyzing trace with hash 2097985007, now seen corresponding path program 1 times [2018-12-03 15:41:04,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:04,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:04,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:04,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:04,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:04,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:04,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:04,461 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:04,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:04,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:04,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:04,479 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2018-12-03 15:41:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:04,665 INFO L93 Difference]: Finished difference Result 49 states and 80 transitions. [2018-12-03 15:41:04,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:04,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 15:41:04,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:04,684 INFO L225 Difference]: With dead ends: 49 [2018-12-03 15:41:04,684 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:41:04,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:04,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:41:04,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 15:41:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:41:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2018-12-03 15:41:04,729 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 40 transitions. Word has length 10 [2018-12-03 15:41:04,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:04,730 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 40 transitions. [2018-12-03 15:41:04,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:04,730 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 40 transitions. [2018-12-03 15:41:04,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:41:04,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:04,731 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:04,731 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:04,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:04,731 INFO L82 PathProgramCache]: Analyzing trace with hash -509365433, now seen corresponding path program 1 times [2018-12-03 15:41:04,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:04,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:04,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:04,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:04,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:04,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:04,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:04,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:04,818 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:04,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:04,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:04,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:04,820 INFO L87 Difference]: Start difference. First operand 26 states and 40 transitions. Second operand 3 states. [2018-12-03 15:41:05,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:05,084 INFO L93 Difference]: Finished difference Result 53 states and 83 transitions. [2018-12-03 15:41:05,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:05,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-03 15:41:05,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:05,086 INFO L225 Difference]: With dead ends: 53 [2018-12-03 15:41:05,087 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:41:05,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:05,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:41:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 15:41:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:41:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2018-12-03 15:41:05,096 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 13 [2018-12-03 15:41:05,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:05,097 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2018-12-03 15:41:05,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2018-12-03 15:41:05,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:41:05,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:05,098 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:05,099 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:05,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:05,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1912029775, now seen corresponding path program 1 times [2018-12-03 15:41:05,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:05,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:05,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:05,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:05,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:41:05,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:05,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:05,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:05,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:05,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:05,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:05,218 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 3 states. [2018-12-03 15:41:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:05,424 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2018-12-03 15:41:05,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:05,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-03 15:41:05,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:05,426 INFO L225 Difference]: With dead ends: 62 [2018-12-03 15:41:05,426 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:41:05,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:41:05,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 15:41:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 15:41:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-12-03 15:41:05,435 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 19 [2018-12-03 15:41:05,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:05,436 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-12-03 15:41:05,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:05,436 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-12-03 15:41:05,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:41:05,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:05,438 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:05,438 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:05,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:05,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1719277757, now seen corresponding path program 1 times [2018-12-03 15:41:05,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:05,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:05,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:05,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:05,441 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 15:41:05,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:05,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:05,548 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:05,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:05,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:05,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:05,549 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-12-03 15:41:05,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:05,701 INFO L93 Difference]: Finished difference Result 73 states and 105 transitions. [2018-12-03 15:41:05,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:05,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 15:41:05,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:05,703 INFO L225 Difference]: With dead ends: 73 [2018-12-03 15:41:05,703 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 15:41:05,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:05,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 15:41:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 15:41:05,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 15:41:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2018-12-03 15:41:05,720 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 26 [2018-12-03 15:41:05,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:05,723 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2018-12-03 15:41:05,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:05,723 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2018-12-03 15:41:05,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:41:05,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:05,724 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:05,725 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:05,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:05,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1612801811, now seen corresponding path program 1 times [2018-12-03 15:41:05,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:05,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:05,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:05,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:05,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 15:41:05,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:05,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:05,867 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:05,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:05,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:05,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:05,869 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand 3 states. [2018-12-03 15:41:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:06,038 INFO L93 Difference]: Finished difference Result 86 states and 119 transitions. [2018-12-03 15:41:06,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:06,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 15:41:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:06,040 INFO L225 Difference]: With dead ends: 86 [2018-12-03 15:41:06,041 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 15:41:06,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 15:41:06,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 15:41:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 15:41:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2018-12-03 15:41:06,050 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 34 [2018-12-03 15:41:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:06,050 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2018-12-03 15:41:06,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2018-12-03 15:41:06,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 15:41:06,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:06,052 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:06,053 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:06,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:06,053 INFO L82 PathProgramCache]: Analyzing trace with hash -168763707, now seen corresponding path program 1 times [2018-12-03 15:41:06,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:06,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:06,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:06,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:06,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 15:41:06,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:06,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:06,169 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:06,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:06,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:06,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:06,170 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand 3 states. [2018-12-03 15:41:06,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:06,257 INFO L93 Difference]: Finished difference Result 136 states and 179 transitions. [2018-12-03 15:41:06,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:06,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-03 15:41:06,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:06,260 INFO L225 Difference]: With dead ends: 136 [2018-12-03 15:41:06,260 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 15:41:06,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:06,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 15:41:06,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 15:41:06,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 15:41:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2018-12-03 15:41:06,276 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 43 [2018-12-03 15:41:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:06,277 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2018-12-03 15:41:06,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2018-12-03 15:41:06,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 15:41:06,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:06,279 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:06,279 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:06,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:06,280 INFO L82 PathProgramCache]: Analyzing trace with hash 253938119, now seen corresponding path program 1 times [2018-12-03 15:41:06,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:06,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:06,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:06,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:06,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 15:41:06,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:06,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:06,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:06,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:06,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:06,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:06,350 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand 3 states. [2018-12-03 15:41:06,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:06,436 INFO L93 Difference]: Finished difference Result 188 states and 241 transitions. [2018-12-03 15:41:06,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:06,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-03 15:41:06,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:06,438 INFO L225 Difference]: With dead ends: 188 [2018-12-03 15:41:06,438 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 15:41:06,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:06,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 15:41:06,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 15:41:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 15:41:06,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2018-12-03 15:41:06,453 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 43 [2018-12-03 15:41:06,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:06,454 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2018-12-03 15:41:06,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:06,454 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2018-12-03 15:41:06,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 15:41:06,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:06,456 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:06,456 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:06,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:06,457 INFO L82 PathProgramCache]: Analyzing trace with hash -4227319, now seen corresponding path program 1 times [2018-12-03 15:41:06,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:06,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:06,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:06,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:06,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:41:06,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:06,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:06,592 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:06,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:06,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:06,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:06,594 INFO L87 Difference]: Start difference. First operand 100 states and 126 transitions. Second operand 3 states. [2018-12-03 15:41:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:06,856 INFO L93 Difference]: Finished difference Result 139 states and 179 transitions. [2018-12-03 15:41:06,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:06,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-03 15:41:06,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:06,859 INFO L225 Difference]: With dead ends: 139 [2018-12-03 15:41:06,859 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 15:41:06,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:06,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 15:41:06,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2018-12-03 15:41:06,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 15:41:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 171 transitions. [2018-12-03 15:41:06,887 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 171 transitions. Word has length 43 [2018-12-03 15:41:06,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:06,888 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 171 transitions. [2018-12-03 15:41:06,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 171 transitions. [2018-12-03 15:41:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 15:41:06,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:06,897 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:06,898 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:06,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:06,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1562207431, now seen corresponding path program 1 times [2018-12-03 15:41:06,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:06,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:06,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:06,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:06,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:07,020 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-03 15:41:07,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:07,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:07,022 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:07,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:07,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:07,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:07,025 INFO L87 Difference]: Start difference. First operand 132 states and 171 transitions. Second operand 3 states. [2018-12-03 15:41:07,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:07,267 INFO L93 Difference]: Finished difference Result 297 states and 405 transitions. [2018-12-03 15:41:07,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:07,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-03 15:41:07,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:07,270 INFO L225 Difference]: With dead ends: 297 [2018-12-03 15:41:07,270 INFO L226 Difference]: Without dead ends: 168 [2018-12-03 15:41:07,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:07,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-03 15:41:07,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-12-03 15:41:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 15:41:07,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 222 transitions. [2018-12-03 15:41:07,291 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 222 transitions. Word has length 73 [2018-12-03 15:41:07,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:07,292 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 222 transitions. [2018-12-03 15:41:07,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:07,292 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 222 transitions. [2018-12-03 15:41:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 15:41:07,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:07,294 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:07,294 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:07,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:07,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1926453931, now seen corresponding path program 2 times [2018-12-03 15:41:07,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:07,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:07,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:07,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:07,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-03 15:41:07,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:07,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:07,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:07,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:07,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:07,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:07,385 INFO L87 Difference]: Start difference. First operand 168 states and 222 transitions. Second operand 3 states. [2018-12-03 15:41:07,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:07,675 INFO L93 Difference]: Finished difference Result 405 states and 558 transitions. [2018-12-03 15:41:07,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:07,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-12-03 15:41:07,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:07,677 INFO L225 Difference]: With dead ends: 405 [2018-12-03 15:41:07,677 INFO L226 Difference]: Without dead ends: 228 [2018-12-03 15:41:07,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-12-03 15:41:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-12-03 15:41:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-03 15:41:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 297 transitions. [2018-12-03 15:41:07,710 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 297 transitions. Word has length 76 [2018-12-03 15:41:07,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:07,711 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 297 transitions. [2018-12-03 15:41:07,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:07,711 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 297 transitions. [2018-12-03 15:41:07,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 15:41:07,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:07,713 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:07,713 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:07,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:07,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1254900833, now seen corresponding path program 1 times [2018-12-03 15:41:07,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:07,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:07,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:07,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:07,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 15:41:07,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:07,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:07,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:07,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:07,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:07,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:07,791 INFO L87 Difference]: Start difference. First operand 228 states and 297 transitions. Second operand 3 states. [2018-12-03 15:41:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:08,108 INFO L93 Difference]: Finished difference Result 489 states and 642 transitions. [2018-12-03 15:41:08,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:08,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-12-03 15:41:08,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:08,111 INFO L225 Difference]: With dead ends: 489 [2018-12-03 15:41:08,111 INFO L226 Difference]: Without dead ends: 255 [2018-12-03 15:41:08,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-12-03 15:41:08,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-12-03 15:41:08,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-12-03 15:41:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 327 transitions. [2018-12-03 15:41:08,135 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 327 transitions. Word has length 85 [2018-12-03 15:41:08,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:08,136 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 327 transitions. [2018-12-03 15:41:08,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:08,136 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 327 transitions. [2018-12-03 15:41:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 15:41:08,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:08,138 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 11, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:08,138 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:08,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:08,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1359801879, now seen corresponding path program 1 times [2018-12-03 15:41:08,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:08,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:08,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:08,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:08,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-12-03 15:41:08,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:08,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:08,255 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:08,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:08,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:08,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:08,256 INFO L87 Difference]: Start difference. First operand 255 states and 327 transitions. Second operand 3 states. [2018-12-03 15:41:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:08,694 INFO L93 Difference]: Finished difference Result 543 states and 702 transitions. [2018-12-03 15:41:08,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:08,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-12-03 15:41:08,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:08,697 INFO L225 Difference]: With dead ends: 543 [2018-12-03 15:41:08,697 INFO L226 Difference]: Without dead ends: 285 [2018-12-03 15:41:08,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:08,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-12-03 15:41:08,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-12-03 15:41:08,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-12-03 15:41:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 363 transitions. [2018-12-03 15:41:08,722 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 363 transitions. Word has length 94 [2018-12-03 15:41:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:08,723 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 363 transitions. [2018-12-03 15:41:08,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:08,723 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 363 transitions. [2018-12-03 15:41:08,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 15:41:08,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:08,725 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:08,725 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:08,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:08,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1195726822, now seen corresponding path program 1 times [2018-12-03 15:41:08,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:08,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:08,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:08,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:08,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-12-03 15:41:08,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:08,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:08,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:08,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:08,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:08,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:08,837 INFO L87 Difference]: Start difference. First operand 285 states and 363 transitions. Second operand 3 states. [2018-12-03 15:41:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:09,165 INFO L93 Difference]: Finished difference Result 603 states and 774 transitions. [2018-12-03 15:41:09,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:09,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-03 15:41:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:09,168 INFO L225 Difference]: With dead ends: 603 [2018-12-03 15:41:09,168 INFO L226 Difference]: Without dead ends: 318 [2018-12-03 15:41:09,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:09,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-03 15:41:09,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-12-03 15:41:09,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-12-03 15:41:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 405 transitions. [2018-12-03 15:41:09,194 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 405 transitions. Word has length 104 [2018-12-03 15:41:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:09,194 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 405 transitions. [2018-12-03 15:41:09,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 405 transitions. [2018-12-03 15:41:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 15:41:09,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:09,197 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 13, 11, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:09,197 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:09,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:09,197 INFO L82 PathProgramCache]: Analyzing trace with hash -32649186, now seen corresponding path program 1 times [2018-12-03 15:41:09,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:09,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:09,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:09,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:09,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-12-03 15:41:09,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:09,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:09,309 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:09,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:09,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:09,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:09,310 INFO L87 Difference]: Start difference. First operand 318 states and 405 transitions. Second operand 3 states. [2018-12-03 15:41:09,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:09,891 INFO L93 Difference]: Finished difference Result 633 states and 807 transitions. [2018-12-03 15:41:09,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:09,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-12-03 15:41:09,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:09,894 INFO L225 Difference]: With dead ends: 633 [2018-12-03 15:41:09,895 INFO L226 Difference]: Without dead ends: 318 [2018-12-03 15:41:09,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:09,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-03 15:41:09,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-12-03 15:41:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-12-03 15:41:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 402 transitions. [2018-12-03 15:41:09,924 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 402 transitions. Word has length 115 [2018-12-03 15:41:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:09,924 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 402 transitions. [2018-12-03 15:41:09,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:09,924 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 402 transitions. [2018-12-03 15:41:09,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 15:41:09,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:09,926 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 12, 10, 8, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:09,926 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:09,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:09,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1066373693, now seen corresponding path program 1 times [2018-12-03 15:41:09,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:09,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:09,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:09,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:09,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-12-03 15:41:10,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:10,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:10,045 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:10,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:10,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:10,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:10,046 INFO L87 Difference]: Start difference. First operand 318 states and 402 transitions. Second operand 3 states. [2018-12-03 15:41:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:10,644 INFO L93 Difference]: Finished difference Result 633 states and 801 transitions. [2018-12-03 15:41:10,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:10,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-12-03 15:41:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:10,647 INFO L225 Difference]: With dead ends: 633 [2018-12-03 15:41:10,647 INFO L226 Difference]: Without dead ends: 318 [2018-12-03 15:41:10,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:10,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-03 15:41:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-12-03 15:41:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-12-03 15:41:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 387 transitions. [2018-12-03 15:41:10,671 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 387 transitions. Word has length 124 [2018-12-03 15:41:10,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:10,672 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 387 transitions. [2018-12-03 15:41:10,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:10,672 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 387 transitions. [2018-12-03 15:41:10,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-03 15:41:10,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:10,674 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 13, 11, 9, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:10,674 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:10,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:10,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1427413192, now seen corresponding path program 1 times [2018-12-03 15:41:10,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:10,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:10,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:10,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:10,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 385 proven. 4 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-12-03 15:41:10,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:10,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:10,852 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2018-12-03 15:41:10,854 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [30], [34], [36], [40], [42], [44], [48], [50], [54], [56], [58], [62], [64], [68], [70], [72], [76], [78], [82], [84], [86], [91], [93], [97], [99], [103], [105] [2018-12-03 15:41:10,900 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:10,901 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:11,964 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:11,966 INFO L272 AbstractInterpreter]: Visited 38 different actions 138 times. Merged at 31 different actions 66 times. Widened at 6 different actions 6 times. Found 36 fixpoints after 14 different actions. Largest state had 0 variables. [2018-12-03 15:41:11,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:11,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:11,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:11,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:12,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:12,001 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:12,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 385 proven. 4 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-12-03 15:41:12,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:12,393 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 385 proven. 4 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-12-03 15:41:12,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:12,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 15:41:12,432 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:12,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:41:12,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:41:12,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:12,433 INFO L87 Difference]: Start difference. First operand 318 states and 387 transitions. Second operand 4 states. [2018-12-03 15:41:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:13,494 INFO L93 Difference]: Finished difference Result 757 states and 914 transitions. [2018-12-03 15:41:13,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:41:13,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2018-12-03 15:41:13,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:13,499 INFO L225 Difference]: With dead ends: 757 [2018-12-03 15:41:13,499 INFO L226 Difference]: Without dead ends: 415 [2018-12-03 15:41:13,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:41:13,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-12-03 15:41:13,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 255. [2018-12-03 15:41:13,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-12-03 15:41:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 291 transitions. [2018-12-03 15:41:13,537 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 291 transitions. Word has length 136 [2018-12-03 15:41:13,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:13,537 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 291 transitions. [2018-12-03 15:41:13,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:41:13,537 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 291 transitions. [2018-12-03 15:41:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 15:41:13,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:13,539 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 15, 13, 11, 9, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:13,539 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:13,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:13,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2065701642, now seen corresponding path program 2 times [2018-12-03 15:41:13,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:13,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:13,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:13,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:13,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 417 proven. 3 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2018-12-03 15:41:13,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:13,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:13,726 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:13,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:13,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:13,727 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:13,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:41:13,745 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:41:13,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:41:13,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:13,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 417 proven. 3 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2018-12-03 15:41:13,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 417 proven. 3 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2018-12-03 15:41:14,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:14,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 15:41:14,214 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:14,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:41:14,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:41:14,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:14,216 INFO L87 Difference]: Start difference. First operand 255 states and 291 transitions. Second operand 4 states. [2018-12-03 15:41:14,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:14,791 INFO L93 Difference]: Finished difference Result 429 states and 487 transitions. [2018-12-03 15:41:14,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:41:14,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-12-03 15:41:14,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:14,792 INFO L225 Difference]: With dead ends: 429 [2018-12-03 15:41:14,792 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:41:14,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:41:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:41:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:41:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:41:14,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:41:14,794 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2018-12-03 15:41:14,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:14,794 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:41:14,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:41:14,795 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:41:14,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:41:14,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:41:14,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:14,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:15,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:15,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:15,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:15,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:15,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:15,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:15,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:15,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:15,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:15,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:15,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:15,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:15,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:41:15,351 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 7 [2018-12-03 15:41:16,506 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-12-03 15:41:16,617 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2018-12-03 15:41:16,821 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-12-03 15:41:17,201 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-12-03 15:41:17,416 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2018-12-03 15:41:17,782 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-12-03 15:41:17,952 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 24 [2018-12-03 15:41:18,148 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-12-03 15:41:18,304 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2018-12-03 15:41:18,321 INFO L444 ceAbstractionStarter]: At program point L415(lines 415 432) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4432) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 15:41:18,322 INFO L444 ceAbstractionStarter]: At program point L382(lines 373 395) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)))) [2018-12-03 15:41:18,322 INFO L444 ceAbstractionStarter]: At program point L407(lines 404 420) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) [2018-12-03 15:41:18,322 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 459) no Hoare annotation was computed. [2018-12-03 15:41:18,323 INFO L444 ceAbstractionStarter]: At program point L300(lines 261 300) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560)) (.cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse4 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 12292)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4560) .cse3 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 .cse4))) [2018-12-03 15:41:18,323 INFO L444 ceAbstractionStarter]: At program point L296(lines 296 310) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse2 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1) (and .cse0 .cse2))) [2018-12-03 15:41:18,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 526) no Hoare annotation was computed. [2018-12-03 15:41:18,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 526) no Hoare annotation was computed. [2018-12-03 15:41:18,324 INFO L444 ceAbstractionStarter]: At program point L313(lines 313 333) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse2 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1) (and .cse0 .cse2))) [2018-12-03 15:41:18,325 INFO L444 ceAbstractionStarter]: At program point L309(lines 309 320) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) [2018-12-03 15:41:18,325 INFO L444 ceAbstractionStarter]: At program point L499(lines 499 516) the Hoare annotation is: (let ((.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4))) (or (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) .cse1) (and .cse0 .cse1 .cse2))) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse2))) [2018-12-03 15:41:18,325 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 526) no Hoare annotation was computed. [2018-12-03 15:41:18,325 INFO L444 ceAbstractionStarter]: At program point L351(lines 348 362) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) [2018-12-03 15:41:18,326 INFO L444 ceAbstractionStarter]: At program point L479(lines 479 496) the Hoare annotation is: (let ((.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) .cse0) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1))) [2018-12-03 15:41:18,326 INFO L444 ceAbstractionStarter]: At program point L525(lines 289 525) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4560) (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse2) (and .cse3 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 .cse3))) [2018-12-03 15:41:18,326 INFO L444 ceAbstractionStarter]: At program point L336(lines 336 358) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse2 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1) (and .cse0 .cse2))) [2018-12-03 15:41:18,326 INFO L444 ceAbstractionStarter]: At program point L431(lines 431 458) the Hoare annotation is: false [2018-12-03 15:41:18,327 INFO L444 ceAbstractionStarter]: At program point L332(lines 332 349) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) [2018-12-03 15:41:18,327 INFO L444 ceAbstractionStarter]: At program point L460(lines 457 474) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-12-03 15:41:18,327 INFO L444 ceAbstractionStarter]: At program point L266(lines 266 290) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560)) (.cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse4 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 12292)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4560) .cse3 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 .cse4))) [2018-12-03 15:41:18,327 INFO L444 ceAbstractionStarter]: At program point L394(lines 394 416) the Hoare annotation is: (let ((.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse0))) [2018-12-03 15:41:18,328 INFO L444 ceAbstractionStarter]: At program point L361(lines 361 391) the Hoare annotation is: (let ((.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse1))) [2018-12-03 15:41:18,328 INFO L444 ceAbstractionStarter]: At program point L390(lines 390 405) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse0))) [2018-12-03 15:41:18,328 INFO L444 ceAbstractionStarter]: At program point L357(lines 357 374) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) [2018-12-03 15:41:18,328 INFO L444 ceAbstractionStarter]: At program point L324(lines 319 337) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) [2018-12-03 15:41:18,328 INFO L444 ceAbstractionStarter]: At program point L419(lines 419 450) the Hoare annotation is: (let ((.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4432) .cse0) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1))) [2018-12-03 15:41:18,345 INFO L202 PluginConnector]: Adding new model s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:41:18 BoogieIcfgContainer [2018-12-03 15:41:18,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:41:18,346 INFO L168 Benchmark]: Toolchain (without parser) took 15033.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 718.8 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 43.8 MB). Peak memory consumption was 762.6 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:18,348 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:41:18,348 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:41:18,349 INFO L168 Benchmark]: Boogie Preprocessor took 64.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:41:18,349 INFO L168 Benchmark]: RCFGBuilder took 697.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:18,350 INFO L168 Benchmark]: TraceAbstraction took 14220.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 12.1 MB). Peak memory consumption was 730.9 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:18,354 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 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 697.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14220.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 718.8 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 12.1 MB). Peak memory consumption was 730.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 459]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368 - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: (((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 <= 4432 && 4432 <= ssl3_connect_~s__state~4)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && ssl3_connect_~s__state~4 <= 4560) && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416 - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (4432 <= ssl3_connect_~s__state~4 && ssl3_connect_~s__state~4 <= 4448) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ((((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384 - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (ssl3_connect_~s__state~4 <= 4432 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 479]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (4432 <= ssl3_connect_~s__state~4 && ssl3_connect_~s__state~4 <= 4480)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: ((((((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 12292)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && ssl3_connect_~s__state~4 <= 4560) && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || ((ssl3_connect_~blastFlag~4 <= 2 && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4400 && ssl3_connect_~blastFlag~4 == 3) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__state~4 <= 4528 && 4432 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (4432 <= ssl3_connect_~s__state~4 && ssl3_connect_~s__state~4 <= 4512)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 12292)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && ssl3_connect_~s__state~4 <= 4560) && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || ((ssl3_connect_~blastFlag~4 <= 2 && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400 - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 1 error locations. SAFE Result, 14.1s OverallTime, 17 OverallIterations, 17 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 545 SDtfs, 240 SDslu, 220 SDs, 0 SdLazy, 533 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 602 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 165 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 253 NumberOfFragments, 713 HoareAnnotationTreeSize, 22 FomulaSimplifications, 6566 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1150 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1452 NumberOfCodeBlocks, 1389 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1706 ConstructedInterpolants, 0 QuantifiedInterpolants, 219302 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1007 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 6972/6993 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...