java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 19:18:44,009 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 19:18:44,011 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 19:18:44,028 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 19:18:44,030 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 19:18:44,031 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 19:18:44,032 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 19:18:44,035 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 19:18:44,037 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 19:18:44,045 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 19:18:44,046 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 19:18:44,046 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 19:18:44,047 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 19:18:44,050 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 19:18:44,052 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 19:18:44,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 19:18:44,055 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 19:18:44,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 19:18:44,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 19:18:44,064 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 19:18:44,066 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 19:18:44,067 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 19:18:44,069 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 19:18:44,069 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 19:18:44,070 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 19:18:44,071 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 19:18:44,072 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 19:18:44,073 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 19:18:44,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 19:18:44,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 19:18:44,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 19:18:44,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 19:18:44,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 19:18:44,078 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 19:18:44,081 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 19:18:44,082 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 19:18:44,082 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 19:18:44,107 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 19:18:44,108 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 19:18:44,109 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 19:18:44,109 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 19:18:44,109 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 19:18:44,109 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 19:18:44,109 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 19:18:44,110 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 19:18:44,110 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 19:18:44,110 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 19:18:44,110 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 19:18:44,110 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 19:18:44,111 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 19:18:44,116 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 19:18:44,117 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 19:18:44,117 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 19:18:44,117 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 19:18:44,117 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 19:18:44,118 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 19:18:44,118 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 19:18:44,118 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 19:18:44,118 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 19:18:44,118 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 19:18:44,121 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 19:18:44,121 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 19:18:44,121 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 19:18:44,121 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 19:18:44,121 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 19:18:44,122 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 19:18:44,122 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 19:18:44,122 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 19:18:44,122 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:18:44,122 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 19:18:44,123 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 19:18:44,123 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 19:18:44,123 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 19:18:44,123 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 19:18:44,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 19:18:44,124 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 19:18:44,124 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 19:18:44,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 19:18:44,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 19:18:44,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 19:18:44,189 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 19:18:44,190 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 19:18:44,191 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 19:18:44,191 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 19:18:44,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 19:18:44,285 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 19:18:44,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 19:18:44,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 19:18:44,286 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 19:18:44,307 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 07:18:44" (1/1) ... [2018-12-03 19:18:44,323 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 07:18:44" (1/1) ... [2018-12-03 19:18:44,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 19:18:44,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 19:18:44,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 19:18:44,343 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 19:18:44,357 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 07:18:44" (1/1) ... [2018-12-03 19:18:44,357 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 07:18:44" (1/1) ... [2018-12-03 19:18:44,360 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 07:18:44" (1/1) ... [2018-12-03 19:18:44,369 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 07:18:44" (1/1) ... [2018-12-03 19:18:44,392 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 07:18:44" (1/1) ... [2018-12-03 19:18:44,399 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 07:18:44" (1/1) ... [2018-12-03 19:18:44,407 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 07:18:44" (1/1) ... [2018-12-03 19:18:44,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 19:18:44,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 19:18:44,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 19:18:44,417 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 19:18:44,421 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 07:18:44" (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 19:18:44,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 19:18:44,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 19:18:45,184 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 19:18:45,185 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 19:18:45,185 INFO L202 PluginConnector]: Adding new model s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:18:45 BoogieIcfgContainer [2018-12-03 19:18:45,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 19:18:45,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 19:18:45,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 19:18:45,191 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 19:18:45,191 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 07:18:44" (1/2) ... [2018-12-03 19:18:45,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dacd1f3 and model type s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:18:45, skipping insertion in model container [2018-12-03 19:18:45,192 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 07:18:45" (2/2) ... [2018-12-03 19:18:45,194 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil.c_21.bpl [2018-12-03 19:18:45,204 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 19:18:45,212 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 19:18:45,231 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 19:18:45,267 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 19:18:45,267 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 19:18:45,268 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 19:18:45,268 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 19:18:45,268 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 19:18:45,268 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 19:18:45,268 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 19:18:45,268 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 19:18:45,286 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-12-03 19:18:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 19:18:45,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:45,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:45,297 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:45,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:45,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2097985007, now seen corresponding path program 1 times [2018-12-03 19:18:45,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:45,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:45,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:45,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:45,367 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:45,535 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 19:18:45,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:45,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:18:45,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:45,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:45,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:45,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:45,558 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2018-12-03 19:18:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:45,752 INFO L93 Difference]: Finished difference Result 49 states and 80 transitions. [2018-12-03 19:18:45,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:45,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 19:18:45,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:45,770 INFO L225 Difference]: With dead ends: 49 [2018-12-03 19:18:45,771 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 19:18:45,775 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 19:18:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 19:18:45,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 19:18:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 19:18:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2018-12-03 19:18:45,818 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 40 transitions. Word has length 10 [2018-12-03 19:18:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:45,818 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 40 transitions. [2018-12-03 19:18:45,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 40 transitions. [2018-12-03 19:18:45,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 19:18:45,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:45,820 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:45,820 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:45,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:45,821 INFO L82 PathProgramCache]: Analyzing trace with hash -509365433, now seen corresponding path program 1 times [2018-12-03 19:18:45,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:45,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:45,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:45,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:45,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:45,930 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 19:18:45,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:45,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:45,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:45,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:45,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:45,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:45,934 INFO L87 Difference]: Start difference. First operand 26 states and 40 transitions. Second operand 3 states. [2018-12-03 19:18:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:46,211 INFO L93 Difference]: Finished difference Result 53 states and 83 transitions. [2018-12-03 19:18:46,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:46,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-03 19:18:46,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:46,214 INFO L225 Difference]: With dead ends: 53 [2018-12-03 19:18:46,215 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 19:18:46,216 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 19:18:46,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 19:18:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 19:18:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 19:18:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2018-12-03 19:18:46,229 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 13 [2018-12-03 19:18:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:46,232 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2018-12-03 19:18:46,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2018-12-03 19:18:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 19:18:46,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:46,234 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:46,235 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:46,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:46,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1912029775, now seen corresponding path program 1 times [2018-12-03 19:18:46,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:46,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:46,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:46,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:46,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:46,338 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 19:18:46,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:46,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:46,339 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:46,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:46,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:46,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:46,341 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 3 states. [2018-12-03 19:18:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:46,481 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2018-12-03 19:18:46,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:46,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-03 19:18:46,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:46,483 INFO L225 Difference]: With dead ends: 62 [2018-12-03 19:18:46,483 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 19:18:46,484 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 19:18:46,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 19:18:46,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 19:18:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 19:18:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-12-03 19:18:46,492 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 19 [2018-12-03 19:18:46,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:46,493 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-12-03 19:18:46,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:46,493 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-12-03 19:18:46,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 19:18:46,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:46,494 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 19:18:46,495 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:46,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:46,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1719277757, now seen corresponding path program 1 times [2018-12-03 19:18:46,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:46,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:46,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:46,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:46,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:46,643 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 19:18:46,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:46,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:46,644 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:46,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:46,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:46,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:46,645 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-12-03 19:18:46,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:46,845 INFO L93 Difference]: Finished difference Result 73 states and 105 transitions. [2018-12-03 19:18:46,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:46,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 19:18:46,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:46,847 INFO L225 Difference]: With dead ends: 73 [2018-12-03 19:18:46,848 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 19:18:46,849 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 19:18:46,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 19:18:46,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 19:18:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 19:18:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2018-12-03 19:18:46,858 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 26 [2018-12-03 19:18:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:46,859 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2018-12-03 19:18:46,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2018-12-03 19:18:46,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 19:18:46,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:46,861 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 19:18:46,861 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:46,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:46,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1612801811, now seen corresponding path program 1 times [2018-12-03 19:18:46,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:46,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:46,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:46,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:46,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:46,948 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 19:18:46,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:46,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:46,949 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:46,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:46,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:46,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:46,951 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand 3 states. [2018-12-03 19:18:47,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:47,335 INFO L93 Difference]: Finished difference Result 86 states and 119 transitions. [2018-12-03 19:18:47,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:47,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-03 19:18:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:47,338 INFO L225 Difference]: With dead ends: 86 [2018-12-03 19:18:47,339 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 19:18:47,339 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 19:18:47,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 19:18:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 19:18:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 19:18:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2018-12-03 19:18:47,349 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 34 [2018-12-03 19:18:47,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:47,350 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2018-12-03 19:18:47,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2018-12-03 19:18:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 19:18:47,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:47,354 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 19:18:47,357 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:47,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:47,357 INFO L82 PathProgramCache]: Analyzing trace with hash -168763707, now seen corresponding path program 1 times [2018-12-03 19:18:47,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:47,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:47,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:47,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:47,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:47,484 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 19:18:47,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:47,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:47,485 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:47,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:47,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:47,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:47,489 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand 3 states. [2018-12-03 19:18:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:47,559 INFO L93 Difference]: Finished difference Result 136 states and 179 transitions. [2018-12-03 19:18:47,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:47,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-03 19:18:47,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:47,563 INFO L225 Difference]: With dead ends: 136 [2018-12-03 19:18:47,563 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 19:18:47,564 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 19:18:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 19:18:47,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 19:18:47,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 19:18:47,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2018-12-03 19:18:47,580 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 43 [2018-12-03 19:18:47,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:47,581 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2018-12-03 19:18:47,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:47,581 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2018-12-03 19:18:47,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 19:18:47,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:47,585 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 19:18:47,585 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:47,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:47,587 INFO L82 PathProgramCache]: Analyzing trace with hash 253938119, now seen corresponding path program 1 times [2018-12-03 19:18:47,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:47,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:47,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:47,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:47,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:47,655 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 19:18:47,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:47,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:47,656 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:47,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:47,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:47,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:47,658 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand 3 states. [2018-12-03 19:18:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:47,774 INFO L93 Difference]: Finished difference Result 188 states and 241 transitions. [2018-12-03 19:18:47,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:47,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-03 19:18:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:47,776 INFO L225 Difference]: With dead ends: 188 [2018-12-03 19:18:47,776 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 19:18:47,777 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 19:18:47,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 19:18:47,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 19:18:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 19:18:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2018-12-03 19:18:47,793 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 43 [2018-12-03 19:18:47,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:47,793 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2018-12-03 19:18:47,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:47,794 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2018-12-03 19:18:47,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 19:18:47,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:47,796 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 19:18:47,796 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:47,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:47,796 INFO L82 PathProgramCache]: Analyzing trace with hash -4227319, now seen corresponding path program 1 times [2018-12-03 19:18:47,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:47,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:47,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:47,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:47,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:47,901 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 19:18:47,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:47,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:47,902 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:47,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:47,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:47,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:47,904 INFO L87 Difference]: Start difference. First operand 100 states and 126 transitions. Second operand 3 states. [2018-12-03 19:18:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:47,999 INFO L93 Difference]: Finished difference Result 139 states and 179 transitions. [2018-12-03 19:18:48,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:48,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-03 19:18:48,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:48,001 INFO L225 Difference]: With dead ends: 139 [2018-12-03 19:18:48,002 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 19:18:48,002 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 19:18:48,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 19:18:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2018-12-03 19:18:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 19:18:48,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 171 transitions. [2018-12-03 19:18:48,032 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 171 transitions. Word has length 43 [2018-12-03 19:18:48,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:48,032 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 171 transitions. [2018-12-03 19:18:48,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:48,033 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 171 transitions. [2018-12-03 19:18:48,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 19:18:48,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:48,035 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 19:18:48,036 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:48,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:48,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1562207431, now seen corresponding path program 1 times [2018-12-03 19:18:48,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:48,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:48,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:48,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:48,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:48,139 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 19:18:48,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:48,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:48,140 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:48,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:48,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:48,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:48,142 INFO L87 Difference]: Start difference. First operand 132 states and 171 transitions. Second operand 3 states. [2018-12-03 19:18:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:48,297 INFO L93 Difference]: Finished difference Result 297 states and 405 transitions. [2018-12-03 19:18:48,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:48,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-03 19:18:48,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:48,303 INFO L225 Difference]: With dead ends: 297 [2018-12-03 19:18:48,303 INFO L226 Difference]: Without dead ends: 168 [2018-12-03 19:18:48,305 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 19:18:48,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-03 19:18:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-12-03 19:18:48,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 19:18:48,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 222 transitions. [2018-12-03 19:18:48,325 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 222 transitions. Word has length 73 [2018-12-03 19:18:48,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:48,325 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 222 transitions. [2018-12-03 19:18:48,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:48,325 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 222 transitions. [2018-12-03 19:18:48,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 19:18:48,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:48,328 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 19:18:48,328 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:48,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:48,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1926453931, now seen corresponding path program 2 times [2018-12-03 19:18:48,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:48,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:48,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:48,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:48,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:48,433 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 19:18:48,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:48,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:48,434 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:48,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:48,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:48,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:48,435 INFO L87 Difference]: Start difference. First operand 168 states and 222 transitions. Second operand 3 states. [2018-12-03 19:18:49,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:49,085 INFO L93 Difference]: Finished difference Result 405 states and 558 transitions. [2018-12-03 19:18:49,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:49,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-12-03 19:18:49,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:49,088 INFO L225 Difference]: With dead ends: 405 [2018-12-03 19:18:49,088 INFO L226 Difference]: Without dead ends: 228 [2018-12-03 19:18:49,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 19:18:49,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-12-03 19:18:49,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-12-03 19:18:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-03 19:18:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 297 transitions. [2018-12-03 19:18:49,113 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 297 transitions. Word has length 76 [2018-12-03 19:18:49,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:49,114 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 297 transitions. [2018-12-03 19:18:49,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:49,114 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 297 transitions. [2018-12-03 19:18:49,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 19:18:49,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:49,117 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 19:18:49,117 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:49,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:49,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1254900833, now seen corresponding path program 1 times [2018-12-03 19:18:49,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:49,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:49,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:18:49,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:49,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:49,240 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 19:18:49,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:49,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:49,241 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:49,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:49,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:49,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:49,242 INFO L87 Difference]: Start difference. First operand 228 states and 297 transitions. Second operand 3 states. [2018-12-03 19:18:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:49,837 INFO L93 Difference]: Finished difference Result 489 states and 642 transitions. [2018-12-03 19:18:49,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:49,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-12-03 19:18:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:49,840 INFO L225 Difference]: With dead ends: 489 [2018-12-03 19:18:49,841 INFO L226 Difference]: Without dead ends: 255 [2018-12-03 19:18:49,842 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 19:18:49,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-12-03 19:18:49,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-12-03 19:18:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-12-03 19:18:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 327 transitions. [2018-12-03 19:18:49,871 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 327 transitions. Word has length 85 [2018-12-03 19:18:49,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:49,872 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 327 transitions. [2018-12-03 19:18:49,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:49,872 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 327 transitions. [2018-12-03 19:18:49,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 19:18:49,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:49,874 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 19:18:49,874 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:49,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:49,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1359801879, now seen corresponding path program 1 times [2018-12-03 19:18:49,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:49,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:49,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:49,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:49,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:50,003 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 19:18:50,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:50,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:50,004 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:50,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:50,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:50,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:50,005 INFO L87 Difference]: Start difference. First operand 255 states and 327 transitions. Second operand 3 states. [2018-12-03 19:18:50,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:50,534 INFO L93 Difference]: Finished difference Result 543 states and 702 transitions. [2018-12-03 19:18:50,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:50,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-12-03 19:18:50,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:50,537 INFO L225 Difference]: With dead ends: 543 [2018-12-03 19:18:50,537 INFO L226 Difference]: Without dead ends: 285 [2018-12-03 19:18:50,538 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 19:18:50,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-12-03 19:18:50,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-12-03 19:18:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-12-03 19:18:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 363 transitions. [2018-12-03 19:18:50,565 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 363 transitions. Word has length 94 [2018-12-03 19:18:50,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:50,565 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 363 transitions. [2018-12-03 19:18:50,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:50,566 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 363 transitions. [2018-12-03 19:18:50,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 19:18:50,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:50,568 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 19:18:50,568 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:50,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:50,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1195726822, now seen corresponding path program 1 times [2018-12-03 19:18:50,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:50,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:50,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:50,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:50,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:50,681 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 19:18:50,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:50,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:50,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:50,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:50,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:50,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:50,683 INFO L87 Difference]: Start difference. First operand 285 states and 363 transitions. Second operand 3 states. [2018-12-03 19:18:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:50,970 INFO L93 Difference]: Finished difference Result 603 states and 774 transitions. [2018-12-03 19:18:50,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:50,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-03 19:18:50,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:50,974 INFO L225 Difference]: With dead ends: 603 [2018-12-03 19:18:50,974 INFO L226 Difference]: Without dead ends: 318 [2018-12-03 19:18:50,975 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 19:18:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-03 19:18:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-12-03 19:18:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-12-03 19:18:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 405 transitions. [2018-12-03 19:18:51,002 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 405 transitions. Word has length 104 [2018-12-03 19:18:51,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:51,003 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 405 transitions. [2018-12-03 19:18:51,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:51,003 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 405 transitions. [2018-12-03 19:18:51,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 19:18:51,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:51,005 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 19:18:51,005 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:51,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:51,006 INFO L82 PathProgramCache]: Analyzing trace with hash -32649186, now seen corresponding path program 1 times [2018-12-03 19:18:51,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:51,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:51,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:51,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:51,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:51,112 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 19:18:51,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:51,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:51,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:51,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:51,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:51,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:51,115 INFO L87 Difference]: Start difference. First operand 318 states and 405 transitions. Second operand 3 states. [2018-12-03 19:18:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:51,387 INFO L93 Difference]: Finished difference Result 633 states and 807 transitions. [2018-12-03 19:18:51,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:51,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-12-03 19:18:51,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:51,396 INFO L225 Difference]: With dead ends: 633 [2018-12-03 19:18:51,396 INFO L226 Difference]: Without dead ends: 318 [2018-12-03 19:18:51,397 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 19:18:51,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-03 19:18:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-12-03 19:18:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-12-03 19:18:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 402 transitions. [2018-12-03 19:18:51,427 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 402 transitions. Word has length 115 [2018-12-03 19:18:51,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:51,428 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 402 transitions. [2018-12-03 19:18:51,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 402 transitions. [2018-12-03 19:18:51,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 19:18:51,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:51,430 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 19:18:51,430 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:51,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:51,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1066373693, now seen corresponding path program 1 times [2018-12-03 19:18:51,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:51,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:51,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:51,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:51,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:51,589 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 19:18:51,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:51,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:51,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:51,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:51,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:51,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:51,591 INFO L87 Difference]: Start difference. First operand 318 states and 402 transitions. Second operand 3 states. [2018-12-03 19:18:52,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:52,178 INFO L93 Difference]: Finished difference Result 633 states and 801 transitions. [2018-12-03 19:18:52,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:52,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-12-03 19:18:52,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:52,182 INFO L225 Difference]: With dead ends: 633 [2018-12-03 19:18:52,182 INFO L226 Difference]: Without dead ends: 318 [2018-12-03 19:18:52,183 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 19:18:52,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-03 19:18:52,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-12-03 19:18:52,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-12-03 19:18:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 387 transitions. [2018-12-03 19:18:52,210 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 387 transitions. Word has length 124 [2018-12-03 19:18:52,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:52,210 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 387 transitions. [2018-12-03 19:18:52,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 387 transitions. [2018-12-03 19:18:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-03 19:18:52,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:52,214 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 19:18:52,214 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:52,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:52,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1427413192, now seen corresponding path program 1 times [2018-12-03 19:18:52,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:52,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:52,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:52,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:52,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:52,405 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 19:18:52,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:18:52,405 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:18:52,407 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2018-12-03 19:18:52,412 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 19:18:52,508 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:18:52,509 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 19:18:59,023 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 19:24:58,303 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 19:24:58,305 INFO L272 AbstractInterpreter]: Visited 38 different actions 1868 times. Merged at 37 different actions 1140 times. Widened at 34 different actions 927 times. Found 663 fixpoints after 25 different actions. Largest state had 0 variables. [2018-12-03 19:24:58,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:24:58,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 19:24:58,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:58,318 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 19:24:58,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:24:58,328 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:24:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:24:58,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:24:58,481 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 19:24:58,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:24:58,717 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 19:24:58,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:24:58,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 19:24:58,756 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:24:58,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 19:24:58,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 19:24:58,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 19:24:58,757 INFO L87 Difference]: Start difference. First operand 318 states and 387 transitions. Second operand 4 states. [2018-12-03 19:24:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:24:59,703 INFO L93 Difference]: Finished difference Result 757 states and 914 transitions. [2018-12-03 19:24:59,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 19:24:59,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2018-12-03 19:24:59,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:24:59,706 INFO L225 Difference]: With dead ends: 757 [2018-12-03 19:24:59,706 INFO L226 Difference]: Without dead ends: 415 [2018-12-03 19:24:59,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 19:24:59,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-12-03 19:24:59,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 255. [2018-12-03 19:24:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-12-03 19:24:59,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 291 transitions. [2018-12-03 19:24:59,738 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 291 transitions. Word has length 136 [2018-12-03 19:24:59,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:24:59,739 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 291 transitions. [2018-12-03 19:24:59,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 19:24:59,739 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 291 transitions. [2018-12-03 19:24:59,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 19:24:59,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:24:59,740 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 19:24:59,741 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:24:59,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:24:59,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2065701642, now seen corresponding path program 2 times [2018-12-03 19:24:59,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:24:59,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:24:59,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:24:59,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:24:59,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:24:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:24:59,883 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 19:24:59,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:59,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:24:59,884 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:24:59,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:24:59,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:24:59,884 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 19:24:59,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:24:59,897 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:25:00,014 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 19:25:00,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:25:00,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:25:00,036 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 19:25:00,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:25:00,067 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 19:25:00,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:25:00,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 19:25:00,095 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:25:00,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 19:25:00,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 19:25:00,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 19:25:00,097 INFO L87 Difference]: Start difference. First operand 255 states and 291 transitions. Second operand 4 states. [2018-12-03 19:25:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:00,502 INFO L93 Difference]: Finished difference Result 429 states and 487 transitions. [2018-12-03 19:25:00,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 19:25:00,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-12-03 19:25:00,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:00,505 INFO L225 Difference]: With dead ends: 429 [2018-12-03 19:25:00,506 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 19:25:00,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 19:25:00,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 19:25:00,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 19:25:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 19:25:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 19:25:00,507 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2018-12-03 19:25:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:00,508 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 19:25:00,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 19:25:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 19:25:00,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 19:25:00,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 19:25:00,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:00,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:25:01,027 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 7 [2018-12-03 19:25:01,898 WARN L180 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-12-03 19:25:02,000 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2018-12-03 19:25:02,252 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-12-03 19:25:02,518 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-12-03 19:25:02,879 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2018-12-03 19:25:03,109 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-12-03 19:25:03,406 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-12-03 19:25:03,561 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 19:25:03,561 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 19:25:03,562 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 19:25:03,562 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 19:25:03,562 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 19:25:03,563 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 526) no Hoare annotation was computed. [2018-12-03 19:25:03,563 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 526) no Hoare annotation was computed. [2018-12-03 19:25:03,563 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 19:25:03,563 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 19:25:03,563 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 19:25:03,564 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 526) no Hoare annotation was computed. [2018-12-03 19:25:03,564 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 19:25:03,564 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 19:25:03,564 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 19:25:03,564 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 459) no Hoare annotation was computed. [2018-12-03 19:25:03,565 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 19:25:03,565 INFO L444 ceAbstractionStarter]: At program point L431(lines 431 458) the Hoare annotation is: false [2018-12-03 19:25:03,565 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 19:25:03,565 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 19:25:03,565 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 19:25:03,566 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 19:25:03,566 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 19:25:03,566 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 19:25:03,566 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 19:25:03,566 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 19:25:03,566 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 19:25:03,583 INFO L202 PluginConnector]: Adding new model s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:25:03 BoogieIcfgContainer [2018-12-03 19:25:03,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 19:25:03,584 INFO L168 Benchmark]: Toolchain (without parser) took 379300.42 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.1 GB). Free memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 432.8 MB. Max. memory is 7.1 GB. [2018-12-03 19:25:03,585 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.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 19:25:03,586 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.71 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 19:25:03,586 INFO L168 Benchmark]: Boogie Preprocessor took 73.47 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 19:25:03,587 INFO L168 Benchmark]: RCFGBuilder took 769.41 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-03 19:25:03,588 INFO L168 Benchmark]: TraceAbstraction took 378396.15 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 390.5 MB. Max. memory is 7.1 GB. [2018-12-03 19:25:03,592 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.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. * Boogie Procedure Inliner took 56.71 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 73.47 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 769.41 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 378396.15 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 390.5 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, 378.3s OverallTime, 17 OverallIterations, 17 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 545 SDtfs, 240 SDslu, 220 SDs, 0 SdLazy, 533 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 602 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.1s 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, 365.9s 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, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s 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...