java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:40:56,921 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:40:56,923 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:40:56,934 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:40:56,935 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:40:56,936 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:40:56,937 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:40:56,940 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:40:56,942 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:40:56,943 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:40:56,947 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:40:56,947 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:40:56,948 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:40:56,949 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:40:56,950 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:40:56,952 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:40:56,952 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:40:56,954 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:40:56,956 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:40:56,960 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:40:56,961 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:40:56,963 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:40:56,966 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:40:56,966 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:40:56,967 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:40:56,969 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:40:56,970 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:40:56,971 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:40:56,972 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:40:56,972 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:40:56,973 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:40:56,973 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:40:56,973 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:40:56,974 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:40:56,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:40:56,975 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:40:56,976 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:40:56,988 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:40:56,989 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:40:56,989 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:40:56,990 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:40:56,990 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:40:56,990 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:40:56,990 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:40:56,991 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:40:56,991 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:40:56,991 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:40:56,991 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:40:56,991 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:40:56,991 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:40:56,992 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:40:56,992 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:40:56,993 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:40:56,993 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:40:56,994 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:40:56,994 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:40:56,994 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:40:56,994 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:40:56,994 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:40:56,995 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:40:56,995 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:40:56,995 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:40:56,995 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:40:56,995 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:40:56,997 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:40:56,997 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:40:56,997 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:40:56,997 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:40:56,998 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:40:56,998 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:40:56,998 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:40:56,998 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:40:56,998 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:40:56,998 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:40:56,999 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:40:56,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:40:57,000 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:40:57,000 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:40:57,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:40:57,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:40:57,064 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:40:57,065 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:40:57,066 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:40:57,067 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl [2018-12-03 15:40:57,067 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl' [2018-12-03 15:40:57,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:40:57,155 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:40:57,156 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:40:57,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:40:57,156 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:40:57,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:57" (1/1) ... [2018-12-03 15:40:57,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:57" (1/1) ... [2018-12-03 15:40:57,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:40:57,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:40:57,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:40:57,213 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:40:57,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:57" (1/1) ... [2018-12-03 15:40:57,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:57" (1/1) ... [2018-12-03 15:40:57,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:57" (1/1) ... [2018-12-03 15:40:57,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:57" (1/1) ... [2018-12-03 15:40:57,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:57" (1/1) ... [2018-12-03 15:40:57,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:57" (1/1) ... [2018-12-03 15:40:57,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:57" (1/1) ... [2018-12-03 15:40:57,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:40:57,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:40:57,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:40:57,282 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:40:57,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:40:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:40:57,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:40:58,064 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:40:58,065 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:40:58,065 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:40:58 BoogieIcfgContainer [2018-12-03 15:40:58,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:40:58,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:40:58,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:40:58,072 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:40:58,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:40:57" (1/2) ... [2018-12-03 15:40:58,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c46f48 and model type s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:40:58, skipping insertion in model container [2018-12-03 15:40:58,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:40:58" (2/2) ... [2018-12-03 15:40:58,076 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil.c_16.bpl [2018-12-03 15:40:58,091 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:40:58,100 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:40:58,121 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:40:58,165 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:40:58,165 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:40:58,165 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:40:58,166 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:40:58,166 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:40:58,166 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:40:58,166 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:40:58,166 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:40:58,184 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-12-03 15:40:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:40:58,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:58,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:58,196 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:58,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:58,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1912595551, now seen corresponding path program 1 times [2018-12-03 15:40:58,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:58,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:58,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:58,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:58,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:58,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:58,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:40:58,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:58,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:58,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:58,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:58,435 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-12-03 15:40:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:58,664 INFO L93 Difference]: Finished difference Result 33 states and 56 transitions. [2018-12-03 15:40:58,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:58,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 15:40:58,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:58,683 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:40:58,684 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:40:58,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:40:58,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 15:40:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:40:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2018-12-03 15:40:58,726 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 10 [2018-12-03 15:40:58,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:58,727 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-12-03 15:40:58,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:58,727 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2018-12-03 15:40:58,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:40:58,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:58,728 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:58,729 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:58,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:58,729 INFO L82 PathProgramCache]: Analyzing trace with hash -694754889, now seen corresponding path program 1 times [2018-12-03 15:40:58,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:58,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:58,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:58,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:58,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:58,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:58,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:40:58,840 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:58,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:58,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:58,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:58,843 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 3 states. [2018-12-03 15:40:59,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:59,023 INFO L93 Difference]: Finished difference Result 37 states and 59 transitions. [2018-12-03 15:40:59,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:59,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-03 15:40:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:59,026 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:40:59,026 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:40:59,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:59,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:40:59,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 15:40:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:40:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-12-03 15:40:59,034 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 13 [2018-12-03 15:40:59,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:59,035 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-12-03 15:40:59,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-12-03 15:40:59,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:40:59,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:59,036 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:59,037 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:59,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:59,038 INFO L82 PathProgramCache]: Analyzing trace with hash 479368949, now seen corresponding path program 1 times [2018-12-03 15:40:59,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:59,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:59,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:59,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:59,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:40:59,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:59,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:40:59,158 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:59,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:59,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:59,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:59,160 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-12-03 15:40:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:59,322 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2018-12-03 15:40:59,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:59,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 15:40:59,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:59,324 INFO L225 Difference]: With dead ends: 46 [2018-12-03 15:40:59,325 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:40:59,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:59,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:40:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 15:40:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:40:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-03 15:40:59,332 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 17 [2018-12-03 15:40:59,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:59,333 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-03 15:40:59,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-03 15:40:59,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:40:59,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:59,334 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:59,335 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:59,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:59,335 INFO L82 PathProgramCache]: Analyzing trace with hash 2107312679, now seen corresponding path program 1 times [2018-12-03 15:40:59,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:59,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:59,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:59,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:59,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 15:40:59,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:59,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:40:59,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:59,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:59,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:59,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:59,437 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-12-03 15:40:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:59,584 INFO L93 Difference]: Finished difference Result 57 states and 81 transitions. [2018-12-03 15:40:59,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:59,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 15:40:59,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:59,587 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:40:59,587 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:40:59,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:59,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:40:59,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 15:40:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:40:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2018-12-03 15:40:59,595 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 22 [2018-12-03 15:40:59,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:59,596 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-12-03 15:40:59,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2018-12-03 15:40:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:40:59,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:59,598 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:59,598 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:59,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:59,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1908478443, now seen corresponding path program 1 times [2018-12-03 15:40:59,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:59,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:59,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:59,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:59,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 15:40:59,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:40:59,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:40:59,728 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:40:59,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:40:59,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:40:59,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:59,729 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 3 states. [2018-12-03 15:40:59,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:59,966 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2018-12-03 15:40:59,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:40:59,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-03 15:40:59,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:59,968 INFO L225 Difference]: With dead ends: 70 [2018-12-03 15:40:59,968 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 15:40:59,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:40:59,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 15:40:59,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 15:40:59,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 15:40:59,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2018-12-03 15:40:59,976 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 28 [2018-12-03 15:40:59,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:59,976 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2018-12-03 15:40:59,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:40:59,977 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2018-12-03 15:40:59,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 15:40:59,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:59,978 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:40:59,978 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:59,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:59,979 INFO L82 PathProgramCache]: Analyzing trace with hash 685039927, now seen corresponding path program 1 times [2018-12-03 15:40:59,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:59,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:59,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:59,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:59,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:00,115 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:41:00,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:00,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:00,116 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:00,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:00,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:00,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:00,119 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 3 states. [2018-12-03 15:41:00,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:00,221 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2018-12-03 15:41:00,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:00,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-03 15:41:00,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:00,226 INFO L225 Difference]: With dead ends: 59 [2018-12-03 15:41:00,226 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 15:41:00,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:00,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 15:41:00,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-12-03 15:41:00,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 15:41:00,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2018-12-03 15:41:00,238 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 35 [2018-12-03 15:41:00,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:00,239 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2018-12-03 15:41:00,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:00,239 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2018-12-03 15:41:00,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:41:00,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:00,241 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:00,241 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:00,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:00,241 INFO L82 PathProgramCache]: Analyzing trace with hash -82130889, now seen corresponding path program 1 times [2018-12-03 15:41:00,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:00,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:00,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:00,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:00,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 15:41:00,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:00,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:00,316 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:00,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:00,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:00,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:00,318 INFO L87 Difference]: Start difference. First operand 53 states and 73 transitions. Second operand 3 states. [2018-12-03 15:41:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:00,483 INFO L93 Difference]: Finished difference Result 111 states and 157 transitions. [2018-12-03 15:41:00,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:00,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 15:41:00,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:00,486 INFO L225 Difference]: With dead ends: 111 [2018-12-03 15:41:00,489 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:41:00,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:00,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:41:00,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 15:41:00,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 15:41:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2018-12-03 15:41:00,509 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 44 [2018-12-03 15:41:00,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:00,509 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2018-12-03 15:41:00,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:00,515 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2018-12-03 15:41:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 15:41:00,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:00,517 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:00,517 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:00,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:00,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1942977721, now seen corresponding path program 1 times [2018-12-03 15:41:00,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:00,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:00,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:00,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:00,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-03 15:41:00,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:00,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:00,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:00,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:00,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:00,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:00,640 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand 3 states. [2018-12-03 15:41:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:01,133 INFO L93 Difference]: Finished difference Result 143 states and 203 transitions. [2018-12-03 15:41:01,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:01,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-03 15:41:01,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:01,136 INFO L225 Difference]: With dead ends: 143 [2018-12-03 15:41:01,136 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 15:41:01,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 15:41:01,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 15:41:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 15:41:01,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-12-03 15:41:01,162 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 53 [2018-12-03 15:41:01,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:01,165 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-12-03 15:41:01,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:01,166 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-12-03 15:41:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 15:41:01,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:01,173 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:01,174 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:01,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:01,174 INFO L82 PathProgramCache]: Analyzing trace with hash 138737266, now seen corresponding path program 1 times [2018-12-03 15:41:01,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:01,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:01,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:01,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:01,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-03 15:41:01,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:01,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:01,300 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:01,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:01,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:01,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:01,301 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-12-03 15:41:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:01,476 INFO L93 Difference]: Finished difference Result 177 states and 231 transitions. [2018-12-03 15:41:01,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:01,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-03 15:41:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:01,480 INFO L225 Difference]: With dead ends: 177 [2018-12-03 15:41:01,480 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 15:41:01,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:01,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 15:41:01,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 15:41:01,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 15:41:01,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2018-12-03 15:41:01,496 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 65 [2018-12-03 15:41:01,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:01,497 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2018-12-03 15:41:01,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:01,497 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2018-12-03 15:41:01,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 15:41:01,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:01,499 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:01,500 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:01,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:01,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1273491131, now seen corresponding path program 1 times [2018-12-03 15:41:01,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:01,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:01,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:01,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:01,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:01,598 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-03 15:41:01,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:01,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:01,599 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:01,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:01,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:01,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:01,601 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand 3 states. [2018-12-03 15:41:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:01,729 INFO L93 Difference]: Finished difference Result 209 states and 267 transitions. [2018-12-03 15:41:01,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:01,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-12-03 15:41:01,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:01,732 INFO L225 Difference]: With dead ends: 209 [2018-12-03 15:41:01,732 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 15:41:01,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 15:41:01,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-03 15:41:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 15:41:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2018-12-03 15:41:01,749 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 75 [2018-12-03 15:41:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:01,749 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2018-12-03 15:41:01,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:01,750 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2018-12-03 15:41:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 15:41:01,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:01,751 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:01,752 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:01,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:01,752 INFO L82 PathProgramCache]: Analyzing trace with hash 739368033, now seen corresponding path program 1 times [2018-12-03 15:41:01,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:01,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:01,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:01,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:01,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-03 15:41:01,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:01,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:01,858 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:01,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:01,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:01,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:01,861 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 3 states. [2018-12-03 15:41:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:02,403 INFO L93 Difference]: Finished difference Result 255 states and 327 transitions. [2018-12-03 15:41:02,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:02,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-12-03 15:41:02,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:02,405 INFO L225 Difference]: With dead ends: 255 [2018-12-03 15:41:02,405 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 15:41:02,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:02,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 15:41:02,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-12-03 15:41:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 15:41:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 167 transitions. [2018-12-03 15:41:02,421 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 167 transitions. Word has length 86 [2018-12-03 15:41:02,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:02,422 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 167 transitions. [2018-12-03 15:41:02,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2018-12-03 15:41:02,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 15:41:02,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:02,424 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:02,424 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:02,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:02,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1128890468, now seen corresponding path program 1 times [2018-12-03 15:41:02,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:02,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:02,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:02,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:02,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 139 proven. 8 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-03 15:41:02,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:02,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:02,630 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2018-12-03 15:41:02,633 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [44], [46], [50], [52], [54], [59], [61], [65], [67], [71], [73] [2018-12-03 15:41:02,699 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:02,700 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:03,652 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:03,654 INFO L272 AbstractInterpreter]: Visited 26 different actions 66 times. Merged at 18 different actions 27 times. Never widened. Found 22 fixpoints after 11 different actions. Largest state had 0 variables. [2018-12-03 15:41:03,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:03,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:03,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:03,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:03,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:03,717 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:03,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 139 proven. 8 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-03 15:41:03,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 139 proven. 8 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-03 15:41:04,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:04,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 15:41:04,126 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:04,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:41:04,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:41:04,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:04,128 INFO L87 Difference]: Start difference. First operand 141 states and 167 transitions. Second operand 4 states. [2018-12-03 15:41:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:04,730 INFO L93 Difference]: Finished difference Result 387 states and 465 transitions. [2018-12-03 15:41:04,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:41:04,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-03 15:41:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:04,732 INFO L225 Difference]: With dead ends: 387 [2018-12-03 15:41:04,732 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:41:04,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:41:04,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:41:04,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:41:04,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:41:04,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:41:04,734 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2018-12-03 15:41:04,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:04,734 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:41:04,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:41:04,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:41:04,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:41:04,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:41:05,007 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-12-03 15:41:05,428 INFO L444 ceAbstractionStarter]: At program point L353(lines 353 368) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 15:41:05,429 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 419) no Hoare annotation was computed. [2018-12-03 15:41:05,429 INFO L444 ceAbstractionStarter]: At program point L420(lines 417 434) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 15:41:05,429 INFO L444 ceAbstractionStarter]: At program point L383(lines 383 410) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 15:41:05,429 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 486) no Hoare annotation was computed. [2018-12-03 15:41:05,429 INFO L444 ceAbstractionStarter]: At program point L317(lines 317 332) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 15:41:05,429 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 486) no Hoare annotation was computed. [2018-12-03 15:41:05,429 INFO L444 ceAbstractionStarter]: At program point L379(lines 379 390) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) [2018-12-03 15:41:05,430 INFO L444 ceAbstractionStarter]: At program point L371(lines 371 380) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 15:41:05,430 INFO L444 ceAbstractionStarter]: At program point L264(lines 264 288) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 15:41:05,430 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 486) no Hoare annotation was computed. [2018-12-03 15:41:05,430 INFO L444 ceAbstractionStarter]: At program point L335(lines 335 350) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 15:41:05,430 INFO L444 ceAbstractionStarter]: At program point L459(lines 459 476) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 15:41:05,430 INFO L444 ceAbstractionStarter]: At program point L298(lines 259 298) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 15:41:05,430 INFO L444 ceAbstractionStarter]: At program point L294(lines 294 314) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 15:41:05,431 INFO L444 ceAbstractionStarter]: At program point L389(lines 389 418) the Hoare annotation is: false [2018-12-03 15:41:05,431 INFO L444 ceAbstractionStarter]: At program point L439(lines 439 456) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 15:41:05,431 INFO L444 ceAbstractionStarter]: At program point L485(lines 287 485) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 15:41:05,442 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:41:05 BoogieIcfgContainer [2018-12-03 15:41:05,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:41:05,443 INFO L168 Benchmark]: Toolchain (without parser) took 8289.15 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 711.5 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -513.4 MB). Peak memory consumption was 198.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:05,444 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:41:05,445 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:41:05,445 INFO L168 Benchmark]: Boogie Preprocessor took 65.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:41:05,446 INFO L168 Benchmark]: RCFGBuilder took 784.03 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 15:41:05,447 INFO L168 Benchmark]: TraceAbstraction took 7375.13 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 711.5 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -555.7 MB). Peak memory consumption was 155.8 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:05,451 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.20 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.09 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 65.87 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 784.03 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 7375.13 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 711.5 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -555.7 MB). Peak memory consumption was 155.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 419]: 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: 417]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4368 || ssl3_connect_~blastFlag~4 <= 4) || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4368 || ssl3_connect_~blastFlag~4 <= 4) || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4368 || ssl3_connect_~blastFlag~4 <= 4) || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432 - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4368 || ssl3_connect_~blastFlag~4 <= 4) || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 7.2s OverallTime, 12 OverallIterations, 12 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 318 SDtfs, 36 SDslu, 67 SDs, 0 SdLazy, 361 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 262 NumberOfFragments, 188 HoareAnnotationTreeSize, 14 FomulaSimplifications, 1789 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 84 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 644 NumberOfCodeBlocks, 644 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 728 ConstructedInterpolants, 0 QuantifiedInterpolants, 71346 SizeOfPredicates, 2 NumberOfNonLiveVariables, 506 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 2239/2263 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...