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_srvr_7.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:41:33,667 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:41:33,672 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:41:33,692 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:41:33,692 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:41:33,693 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:41:33,697 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:41:33,700 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:41:33,702 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:41:33,703 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:41:33,706 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:41:33,706 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:41:33,713 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:41:33,714 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:41:33,715 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:41:33,717 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:41:33,718 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:41:33,719 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:41:33,721 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:41:33,723 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:41:33,724 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:41:33,726 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:41:33,729 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:41:33,729 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:41:33,729 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:41:33,730 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:41:33,731 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:41:33,732 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:41:33,733 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:41:33,734 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:41:33,734 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:41:33,735 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:41:33,735 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:41:33,735 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:41:33,736 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:41:33,737 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:41:33,737 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:41:33,750 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:41:33,750 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:41:33,751 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:41:33,751 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:41:33,752 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:41:33,752 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:41:33,752 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:41:33,752 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:41:33,753 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:41:33,753 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:41:33,753 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:41:33,753 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:41:33,753 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:41:33,753 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:41:33,754 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:41:33,754 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:41:33,754 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:41:33,755 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:41:33,755 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:41:33,755 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:41:33,755 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:41:33,755 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:41:33,756 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:41:33,756 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:41:33,756 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:41:33,756 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:41:33,756 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:41:33,756 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:41:33,757 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:41:33,757 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:41:33,757 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:41:33,757 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:41:33,757 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:41:33,758 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:41:33,758 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:41:33,758 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:41:33,758 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:41:33,758 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:41:33,759 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:41:33,759 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:41:33,759 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:41:33,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:41:33,809 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:41:33,812 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:41:33,813 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:41:33,814 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:41:33,814 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_7.cil.c_19.bpl [2018-12-03 15:41:33,815 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_7.cil.c_19.bpl' [2018-12-03 15:41:33,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:41:33,875 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:41:33,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:33,876 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:41:33,876 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:41:33,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... [2018-12-03 15:41:33,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... [2018-12-03 15:41:33,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:33,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:41:33,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:41:33,916 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:41:33,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... [2018-12-03 15:41:33,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... [2018-12-03 15:41:33,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... [2018-12-03 15:41:33,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... [2018-12-03 15:41:33,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... [2018-12-03 15:41:33,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... [2018-12-03 15:41:33,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... [2018-12-03 15:41:33,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:41:33,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:41:33,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:41:33,951 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:41:33,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:41:34,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:41:34,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:41:34,603 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:41:34,603 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:41:34,604 INFO L202 PluginConnector]: Adding new model s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:34 BoogieIcfgContainer [2018-12-03 15:41:34,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:41:34,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:41:34,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:41:34,608 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:41:34,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/2) ... [2018-12-03 15:41:34,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf5c8e4 and model type s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:41:34, skipping insertion in model container [2018-12-03 15:41:34,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:34" (2/2) ... [2018-12-03 15:41:34,612 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c_19.bpl [2018-12-03 15:41:34,622 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:41:34,630 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:41:34,648 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:41:34,683 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:41:34,683 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:41:34,683 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:41:34,684 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:41:34,684 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:41:34,684 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:41:34,684 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:41:34,684 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:41:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-12-03 15:41:34,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:41:34,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:34,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:34,711 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:34,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:34,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1807955439, now seen corresponding path program 1 times [2018-12-03 15:41:34,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:34,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:34,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:34,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:34,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:34,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:34,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:34,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:34,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:34,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:34,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:34,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:34,947 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-12-03 15:41:35,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:35,099 INFO L93 Difference]: Finished difference Result 29 states and 44 transitions. [2018-12-03 15:41:35,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:35,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-03 15:41:35,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:35,115 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:41:35,115 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:41:35,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:35,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:41:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 15:41:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:41:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-12-03 15:41:35,158 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 7 [2018-12-03 15:41:35,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:35,159 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-03 15:41:35,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:35,159 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-12-03 15:41:35,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:41:35,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:35,160 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:35,160 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:35,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:35,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1100281751, now seen corresponding path program 1 times [2018-12-03 15:41:35,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:35,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:35,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:35,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:35,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:35,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:35,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:35,277 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:35,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:35,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:35,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:35,280 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 3 states. [2018-12-03 15:41:35,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:35,447 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2018-12-03 15:41:35,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:35,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 15:41:35,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:35,449 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:41:35,449 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:41:35,451 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:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:41:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:41:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:41:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-12-03 15:41:35,456 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 10 [2018-12-03 15:41:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:35,457 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-12-03 15:41:35,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2018-12-03 15:41:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:41:35,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:35,458 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:35,458 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:35,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:35,459 INFO L82 PathProgramCache]: Analyzing trace with hash -2082374887, now seen corresponding path program 1 times [2018-12-03 15:41:35,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:35,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:35,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:35,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:35,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:41:35,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:35,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:35,585 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:35,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:35,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:35,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:35,587 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 3 states. [2018-12-03 15:41:35,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:35,685 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2018-12-03 15:41:35,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:35,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 15:41:35,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:35,687 INFO L225 Difference]: With dead ends: 44 [2018-12-03 15:41:35,688 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:41:35,688 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:35,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:41:35,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-12-03 15:41:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:41:35,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-12-03 15:41:35,702 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 14 [2018-12-03 15:41:35,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:35,703 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-03 15:41:35,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:35,703 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-12-03 15:41:35,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:41:35,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:35,707 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:35,709 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:35,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:35,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1026052440, now seen corresponding path program 1 times [2018-12-03 15:41:35,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:35,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:35,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:35,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:35,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:41:35,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:35,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:35,879 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:35,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:35,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:35,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:35,883 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 3 states. [2018-12-03 15:41:35,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:35,999 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-12-03 15:41:36,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:36,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-03 15:41:36,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:36,002 INFO L225 Difference]: With dead ends: 56 [2018-12-03 15:41:36,002 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:41:36,003 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:36,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:41:36,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 15:41:36,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:41:36,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-12-03 15:41:36,012 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 23 [2018-12-03 15:41:36,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:36,012 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-12-03 15:41:36,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:36,013 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-12-03 15:41:36,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:41:36,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:36,014 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:36,014 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:36,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:36,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1274183299, now seen corresponding path program 1 times [2018-12-03 15:41:36,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:36,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:36,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:36,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:36,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 15:41:36,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:36,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:36,129 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:36,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:36,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:36,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:36,130 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2018-12-03 15:41:36,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:36,196 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2018-12-03 15:41:36,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:36,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-03 15:41:36,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:36,198 INFO L225 Difference]: With dead ends: 73 [2018-12-03 15:41:36,198 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 15:41:36,199 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:36,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 15:41:36,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 15:41:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 15:41:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-12-03 15:41:36,207 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 32 [2018-12-03 15:41:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:36,208 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-12-03 15:41:36,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:36,208 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-12-03 15:41:36,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:41:36,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:36,210 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:36,210 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:36,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:36,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1954241669, now seen corresponding path program 1 times [2018-12-03 15:41:36,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:36,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:36,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:36,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:36,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-03 15:41:36,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:36,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:36,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:36,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:36,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:36,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:36,331 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 3 states. [2018-12-03 15:41:36,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:36,453 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2018-12-03 15:41:36,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:36,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-03 15:41:36,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:36,455 INFO L225 Difference]: With dead ends: 86 [2018-12-03 15:41:36,455 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 15:41:36,456 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:36,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 15:41:36,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 15:41:36,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 15:41:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-12-03 15:41:36,465 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 32 [2018-12-03 15:41:36,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:36,465 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-12-03 15:41:36,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:36,465 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-12-03 15:41:36,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 15:41:36,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:36,467 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:36,467 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:36,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:36,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1319638523, now seen corresponding path program 1 times [2018-12-03 15:41:36,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:36,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:36,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:36,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:36,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-03 15:41:36,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:36,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:36,579 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:36,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:36,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:36,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:36,581 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 3 states. [2018-12-03 15:41:36,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:36,666 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-12-03 15:41:36,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:36,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-03 15:41:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:36,669 INFO L225 Difference]: With dead ends: 64 [2018-12-03 15:41:36,670 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 15:41:36,670 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:36,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 15:41:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-12-03 15:41:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 15:41:36,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2018-12-03 15:41:36,681 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 37 [2018-12-03 15:41:36,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:36,681 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2018-12-03 15:41:36,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2018-12-03 15:41:36,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 15:41:36,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:36,683 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:36,684 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:36,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:36,684 INFO L82 PathProgramCache]: Analyzing trace with hash 158773189, now seen corresponding path program 1 times [2018-12-03 15:41:36,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:36,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:36,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:36,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:36,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:41:36,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:36,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:36,767 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:36,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:36,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:36,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:36,769 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 3 states. [2018-12-03 15:41:36,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:36,887 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2018-12-03 15:41:36,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:36,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-03 15:41:36,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:36,888 INFO L225 Difference]: With dead ends: 120 [2018-12-03 15:41:36,889 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 15:41:36,889 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:36,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 15:41:36,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 15:41:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 15:41:36,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2018-12-03 15:41:36,900 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 37 [2018-12-03 15:41:36,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:36,901 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-12-03 15:41:36,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:36,901 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2018-12-03 15:41:36,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 15:41:36,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:36,903 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:36,904 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:36,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:36,904 INFO L82 PathProgramCache]: Analyzing trace with hash 336869209, now seen corresponding path program 1 times [2018-12-03 15:41:36,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:36,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:36,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:36,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:36,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 127 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 15:41:37,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:37,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:37,031 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-12-03 15:41:37,033 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [30], [35], [37], [41], [43], [47], [49], [51], [53] [2018-12-03 15:41:37,087 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:37,087 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:37,897 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:37,899 INFO L272 AbstractInterpreter]: Visited 20 different actions 54 times. Merged at 15 different actions 25 times. Never widened. Found 14 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 15:41:37,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:37,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:37,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:37,948 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:37,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:37,959 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:38,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 127 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 15:41:38,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 127 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 15:41:38,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:38,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 15:41:38,330 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:38,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:41:38,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:41:38,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:38,331 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 4 states. [2018-12-03 15:41:38,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:38,974 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2018-12-03 15:41:38,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:41:38,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-03 15:41:38,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:38,975 INFO L225 Difference]: With dead ends: 118 [2018-12-03 15:41:38,976 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:41:38,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 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:38,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:41:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:41:38,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:41:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:41:38,978 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-12-03 15:41:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:38,978 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:41:38,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:41:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:41:38,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:41:38,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:41:39,385 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 22 [2018-12-03 15:41:39,744 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2018-12-03 15:41:39,907 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-12-03 15:41:40,059 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-12-03 15:41:40,455 INFO L444 ceAbstractionStarter]: At program point L382(lines 377 392) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) [2018-12-03 15:41:40,455 INFO L444 ceAbstractionStarter]: At program point L337(lines 337 348) the Hoare annotation is: (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4) (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656))) [2018-12-03 15:41:40,455 INFO L444 ceAbstractionStarter]: At program point L271(lines 271 287) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8464)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)))) [2018-12-03 15:41:40,455 INFO L444 ceAbstractionStarter]: At program point L391(lines 388 398) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-12-03 15:41:40,456 INFO L444 ceAbstractionStarter]: At program point L354(lines 351 364) the Hoare annotation is: (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4) (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640))) [2018-12-03 15:41:40,456 INFO L444 ceAbstractionStarter]: At program point L321(lines 321 329) the Hoare annotation is: (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4) (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656))) [2018-12-03 15:41:40,456 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 405) no Hoare annotation was computed. [2018-12-03 15:41:40,456 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 405) no Hoare annotation was computed. [2018-12-03 15:41:40,456 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 353) no Hoare annotation was computed. [2018-12-03 15:41:40,456 INFO L444 ceAbstractionStarter]: At program point L404(lines 286 404) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)))) [2018-12-03 15:41:40,456 INFO L444 ceAbstractionStarter]: At program point L371(lines 371 389) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-12-03 15:41:40,457 INFO L444 ceAbstractionStarter]: At program point L363(lines 363 378) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8656))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) .cse0))) [2018-12-03 15:41:40,457 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 405) no Hoare annotation was computed. [2018-12-03 15:41:40,457 INFO L444 ceAbstractionStarter]: At program point L347(lines 347 352) the Hoare annotation is: false [2018-12-03 15:41:40,457 INFO L444 ceAbstractionStarter]: At program point L295(lines 258 295) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8464)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)))) [2018-12-03 15:41:40,458 INFO L444 ceAbstractionStarter]: At program point L291(lines 291 310) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)))) [2018-12-03 15:41:40,474 INFO L202 PluginConnector]: Adding new model s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:41:40 BoogieIcfgContainer [2018-12-03 15:41:40,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:41:40,475 INFO L168 Benchmark]: Toolchain (without parser) took 6601.90 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 694.2 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -517.8 MB). Peak memory consumption was 176.4 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:40,480 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 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:40,480 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.27 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:40,481 INFO L168 Benchmark]: Boogie Preprocessor took 34.33 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:40,482 INFO L168 Benchmark]: RCFGBuilder took 653.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:40,483 INFO L168 Benchmark]: TraceAbstraction took 5869.64 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 694.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -549.5 MB). Peak memory consumption was 144.7 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:40,493 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.16 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 40.27 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 34.33 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 653.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5869.64 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 694.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -549.5 MB). Peak memory consumption was 144.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 353]: 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: 271]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 4 && ssl3_accept_~s__state~5 == 8496) || (ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640)) || (ssl3_accept_~blastFlag~5 <= 4 && ssl3_accept_~s__state~5 == 8464)) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: (((ssl3_accept_~blastFlag~5 <= 4 && ssl3_accept_~s__state~5 == 8496) || (ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640)) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8656 - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5 - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || ssl3_accept_~blastFlag~5 == 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 4 && 8656 <= ssl3_accept_~s__state~5 - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 4 && ssl3_accept_~s__state~5 == 8496) || (ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640)) || (ssl3_accept_~blastFlag~5 <= 4 && ssl3_accept_~s__state~5 == 8464)) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640)) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640)) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8656) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: (((ssl3_accept_~blastFlag~5 <= 4 && ssl3_accept_~s__state~5 == 8496) || (ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640)) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. SAFE Result, 5.7s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 170 SDtfs, 25 SDslu, 75 SDs, 0 SdLazy, 143 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 71 NumberOfFragments, 250 HoareAnnotationTreeSize, 12 FomulaSimplifications, 381 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 94 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 361 ConstructedInterpolants, 0 QuantifiedInterpolants, 22843 SizeOfPredicates, 2 NumberOfNonLiveVariables, 463 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 720/735 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...