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_2.BV.c.cil.c_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:41:21,684 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:41:21,686 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:41:21,699 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:41:21,700 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:41:21,701 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:41:21,702 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:41:21,704 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:41:21,706 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:41:21,707 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:41:21,708 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:41:21,708 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:41:21,709 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:41:21,710 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:41:21,711 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:41:21,712 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:41:21,713 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:41:21,715 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:41:21,717 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:41:21,719 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:41:21,720 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:41:21,722 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:41:21,724 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:41:21,725 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:41:21,725 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:41:21,726 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:41:21,730 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:41:21,731 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:41:21,732 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:41:21,733 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:41:21,739 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:41:21,740 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:41:21,740 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:41:21,740 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:41:21,741 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:41:21,742 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:41:21,742 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:21,769 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:41:21,769 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:41:21,770 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:41:21,770 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:41:21,770 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:41:21,770 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:41:21,773 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:41:21,773 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:41:21,774 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:41:21,774 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:41:21,774 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:41:21,775 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:41:21,775 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:41:21,775 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:41:21,775 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:41:21,776 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:41:21,776 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:41:21,776 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:41:21,778 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:41:21,778 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:41:21,779 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:41:21,779 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:41:21,779 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:41:21,779 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:41:21,779 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:41:21,780 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:41:21,780 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:41:21,780 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:41:21,780 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:41:21,780 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:41:21,781 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:41:21,781 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:41:21,781 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:41:21,781 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:41:21,782 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:41:21,782 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:41:21,782 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:41:21,782 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:41:21,782 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:41:21,783 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:41:21,784 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:41:21,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:41:21,849 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:41:21,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:41:21,857 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:41:21,858 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:41:21,858 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_2.BV.c.cil.c_13.bpl [2018-12-03 15:41:21,859 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_2.BV.c.cil.c_13.bpl' [2018-12-03 15:41:21,944 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:41:21,946 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:41:21,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:21,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:41:21,948 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:41:21,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:21" (1/1) ... [2018-12-03 15:41:21,982 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:21" (1/1) ... [2018-12-03 15:41:21,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:22,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:41:22,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:41:22,000 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:41:22,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:21" (1/1) ... [2018-12-03 15:41:22,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:21" (1/1) ... [2018-12-03 15:41:22,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:21" (1/1) ... [2018-12-03 15:41:22,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:21" (1/1) ... [2018-12-03 15:41:22,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:21" (1/1) ... [2018-12-03 15:41:22,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:21" (1/1) ... [2018-12-03 15:41:22,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:21" (1/1) ... [2018-12-03 15:41:22,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:41:22,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:41:22,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:41:22,056 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:41:22,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:21" (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:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:41:22,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:41:22,668 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:41:22,669 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:41:22,669 INFO L202 PluginConnector]: Adding new model s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:22 BoogieIcfgContainer [2018-12-03 15:41:22,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:41:22,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:41:22,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:41:22,674 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:41:22,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:21" (1/2) ... [2018-12-03 15:41:22,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597018fc and model type s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:41:22, skipping insertion in model container [2018-12-03 15:41:22,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:22" (2/2) ... [2018-12-03 15:41:22,677 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.BV.c.cil.c_13.bpl [2018-12-03 15:41:22,687 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:41:22,695 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:41:22,714 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:41:22,748 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:41:22,748 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:41:22,748 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:41:22,749 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:41:22,749 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:41:22,749 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:41:22,749 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:41:22,749 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:41:22,763 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-12-03 15:41:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:41:22,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:22,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:22,774 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:22,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:22,780 INFO L82 PathProgramCache]: Analyzing trace with hash 212232727, now seen corresponding path program 1 times [2018-12-03 15:41:22,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:22,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:22,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:22,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:22,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:23,030 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:23,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:23,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:23,033 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:23,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:23,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:23,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:23,054 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-12-03 15:41:23,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:23,190 INFO L93 Difference]: Finished difference Result 35 states and 52 transitions. [2018-12-03 15:41:23,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:23,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-03 15:41:23,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:23,204 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:41:23,205 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:41:23,208 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:23,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:41:23,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:41:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:41:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-12-03 15:41:23,250 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 8 [2018-12-03 15:41:23,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:23,251 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-12-03 15:41:23,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:23,251 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2018-12-03 15:41:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:41:23,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:23,252 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:23,253 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:23,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:23,253 INFO L82 PathProgramCache]: Analyzing trace with hash -250815121, now seen corresponding path program 1 times [2018-12-03 15:41:23,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:23,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:23,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:23,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:23,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:23,388 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:23,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:23,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:23,391 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:23,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:23,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:23,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:23,395 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 3 states. [2018-12-03 15:41:23,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:23,590 INFO L93 Difference]: Finished difference Result 55 states and 83 transitions. [2018-12-03 15:41:23,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:23,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-03 15:41:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:23,593 INFO L225 Difference]: With dead ends: 55 [2018-12-03 15:41:23,593 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:41:23,595 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:23,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:41:23,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 15:41:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:41:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2018-12-03 15:41:23,607 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 11 [2018-12-03 15:41:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:23,608 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2018-12-03 15:41:23,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2018-12-03 15:41:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:41:23,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:23,609 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:23,610 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:23,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:23,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1416638413, now seen corresponding path program 1 times [2018-12-03 15:41:23,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:23,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:23,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:23,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:23,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-03 15:41:23,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:23,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:23,713 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:23,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:23,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:23,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:23,714 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 3 states. [2018-12-03 15:41:23,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:23,890 INFO L93 Difference]: Finished difference Result 79 states and 115 transitions. [2018-12-03 15:41:23,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:23,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-03 15:41:23,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:23,892 INFO L225 Difference]: With dead ends: 79 [2018-12-03 15:41:23,892 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 15:41:23,893 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:23,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 15:41:23,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 15:41:23,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 15:41:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-12-03 15:41:23,905 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 19 [2018-12-03 15:41:23,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:23,906 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-12-03 15:41:23,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:23,906 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2018-12-03 15:41:23,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:41:23,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:23,907 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:23,908 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:23,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:23,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1648077349, now seen corresponding path program 1 times [2018-12-03 15:41:23,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:23,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:23,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:23,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:23,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:41:24,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:24,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:24,024 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:24,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:24,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:24,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:24,031 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 3 states. [2018-12-03 15:41:24,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:24,216 INFO L93 Difference]: Finished difference Result 97 states and 135 transitions. [2018-12-03 15:41:24,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:24,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 15:41:24,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:24,220 INFO L225 Difference]: With dead ends: 97 [2018-12-03 15:41:24,220 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 15:41:24,224 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:24,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 15:41:24,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-12-03 15:41:24,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 15:41:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2018-12-03 15:41:24,245 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 22 [2018-12-03 15:41:24,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:24,246 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2018-12-03 15:41:24,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:24,248 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2018-12-03 15:41:24,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:41:24,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:24,249 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:24,249 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:24,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:24,250 INFO L82 PathProgramCache]: Analyzing trace with hash 494540487, now seen corresponding path program 1 times [2018-12-03 15:41:24,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:24,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:24,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:24,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:24,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 15:41:24,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:24,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:24,370 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:24,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:24,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:24,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:24,371 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand 3 states. [2018-12-03 15:41:24,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:24,506 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2018-12-03 15:41:24,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:24,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-03 15:41:24,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:24,508 INFO L225 Difference]: With dead ends: 80 [2018-12-03 15:41:24,508 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 15:41:24,509 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:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 15:41:24,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-12-03 15:41:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 15:41:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2018-12-03 15:41:24,541 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 25 [2018-12-03 15:41:24,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:24,542 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2018-12-03 15:41:24,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:24,542 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-12-03 15:41:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:41:24,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:24,547 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:24,547 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:24,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:24,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1543638863, now seen corresponding path program 1 times [2018-12-03 15:41:24,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:24,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:24,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:24,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:24,552 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-03 15:41:24,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:24,728 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:24,729 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-12-03 15:41:24,731 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [30], [34], [36], [40], [42], [46], [48], [50], [52] [2018-12-03 15:41:24,777 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:24,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:25,442 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:25,443 INFO L272 AbstractInterpreter]: Visited 20 different actions 62 times. Merged at 14 different actions 27 times. Never widened. Found 15 fixpoints after 7 different actions. Largest state had 0 variables. [2018-12-03 15:41:25,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:25,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:25,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:25,488 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:25,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:25,503 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:25,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-03 15:41:25,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:25,758 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-03 15:41:25,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:25,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 15:41:25,789 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:25,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:41:25,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:41:25,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:41:25,792 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand 4 states. [2018-12-03 15:41:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:26,119 INFO L93 Difference]: Finished difference Result 168 states and 215 transitions. [2018-12-03 15:41:26,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:41:26,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-03 15:41:26,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:26,122 INFO L225 Difference]: With dead ends: 168 [2018-12-03 15:41:26,122 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:41:26,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:41:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:41:26,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:41:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:41:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:41:26,124 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2018-12-03 15:41:26,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:26,124 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:41:26,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:41:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:41:26,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:41:26,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:41:26,594 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2018-12-03 15:41:26,810 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-12-03 15:41:27,165 INFO L444 ceAbstractionStarter]: At program point L283(lines 283 302) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1)) [2018-12-03 15:41:27,165 INFO L444 ceAbstractionStarter]: At program point L275(lines 238 275) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4) .cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~4))) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1) (and (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0))) [2018-12-03 15:41:27,165 INFO L444 ceAbstractionStarter]: At program point L271(lines 271 284) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4) .cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~4))) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1) (and (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0))) [2018-12-03 15:41:27,165 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 2 380) no Hoare annotation was computed. [2018-12-03 15:41:27,166 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 2 380) no Hoare annotation was computed. [2018-12-03 15:41:27,166 INFO L444 ceAbstractionStarter]: At program point L251(lines 251 267) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4) .cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~4))) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1) (and (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0))) [2018-12-03 15:41:27,166 INFO L444 ceAbstractionStarter]: At program point L371(lines 371 378) the Hoare annotation is: false [2018-12-03 15:41:27,166 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 2 380) no Hoare annotation was computed. [2018-12-03 15:41:27,166 INFO L444 ceAbstractionStarter]: At program point L306(lines 301 325) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-12-03 15:41:27,167 INFO L444 ceAbstractionStarter]: At program point L348(lines 348 368) the Hoare annotation is: (and (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-12-03 15:41:27,167 INFO L444 ceAbstractionStarter]: At program point L377(lines 266 377) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4) .cse0 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~4))) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1) (and (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0))) [2018-12-03 15:41:27,167 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 379) no Hoare annotation was computed. [2018-12-03 15:41:27,168 INFO L444 ceAbstractionStarter]: At program point L340(lines 340 355) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-12-03 15:41:27,168 INFO L444 ceAbstractionStarter]: At program point L295(lines 295 314) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4) .cse0 .cse1) (and (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1) .cse1))) [2018-12-03 15:41:27,168 INFO L444 ceAbstractionStarter]: At program point L357(lines 354 372) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-12-03 15:41:27,168 INFO L444 ceAbstractionStarter]: At program point L324(lines 324 341) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4) .cse0 .cse1) (and (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 1) .cse1))) [2018-12-03 15:41:27,181 INFO L202 PluginConnector]: Adding new model s3_srvr_2.BV.c.cil.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:41:27 BoogieIcfgContainer [2018-12-03 15:41:27,181 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:41:27,182 INFO L168 Benchmark]: Toolchain (without parser) took 5237.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 712.5 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -564.6 MB). Peak memory consumption was 147.9 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:27,183 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:27,184 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.82 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:27,185 INFO L168 Benchmark]: Boogie Preprocessor took 53.48 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:27,185 INFO L168 Benchmark]: RCFGBuilder took 613.59 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:27,186 INFO L168 Benchmark]: TraceAbstraction took 4510.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 712.5 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -606.9 MB). Peak memory consumption was 105.6 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:27,191 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 52.82 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 53.48 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 613.59 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 4510.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 712.5 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -606.9 MB). Peak memory consumption was 105.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 379]: 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: (((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~4 && ssl3_accept_~blastFlag~4 <= 3) && !(8496 == ssl3_accept_~s__state~4)) || ssl3_accept_~blastFlag~4 <= 1) || (8656 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~4 && ssl3_accept_~blastFlag~4 <= 3) && !(8496 == ssl3_accept_~s__state~4)) || (8640 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 1 && !(8496 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (!(8672 == ssl3_accept_~s__state~4) && 8656 <= ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 3 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~4 && ssl3_accept_~blastFlag~4 <= 3) && !(8496 == ssl3_accept_~s__state~4)) || ssl3_accept_~blastFlag~4 <= 1) || (8656 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~4 && ssl3_accept_~blastFlag~4 <= 3) && !(8496 == ssl3_accept_~s__state~4)) || ssl3_accept_~blastFlag~4 <= 1) || (8656 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: !(8672 == ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 1 - InvariantResult [Line: 301]: Loop Invariant Derived loop invariant: !(8672 == ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 3 - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: (((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~4 && ssl3_accept_~blastFlag~4 <= 3) && !(8496 == ssl3_accept_~s__state~4)) || (8656 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 1 && !(8496 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: 8656 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: (((8640 <= ssl3_accept_~s__s3__tmp__next_state___0~4 && ssl3_accept_~blastFlag~4 <= 3) && !(8496 == ssl3_accept_~s__state~4)) || ssl3_accept_~blastFlag~4 <= 1) || (8656 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (!(8672 == ssl3_accept_~s__state~4) && 8656 <= ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 3 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. SAFE Result, 4.4s OverallTime, 6 OverallIterations, 8 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 111 SDtfs, 48 SDslu, 52 SDs, 0 SdLazy, 101 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 103 NumberOfFragments, 188 HoareAnnotationTreeSize, 12 FomulaSimplifications, 1189 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 163 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 12691 SizeOfPredicates, 2 NumberOfNonLiveVariables, 406 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 397/409 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...