java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:00:05,286 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:00:05,287 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:00:05,300 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:00:05,304 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:00:05,305 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:00:05,306 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:00:05,309 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:00:05,311 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:00:05,312 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:00:05,313 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:00:05,315 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:00:05,316 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:00:05,317 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:00:05,318 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:00:05,322 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:00:05,323 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:00:05,325 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:00:05,327 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:00:05,329 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:00:05,330 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:00:05,331 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:00:05,333 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:00:05,334 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:00:05,334 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:00:05,335 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:00:05,336 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:00:05,337 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:00:05,337 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:00:05,338 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:00:05,339 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:00:05,339 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:00:05,340 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:00:05,340 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:00:05,341 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:00:05,342 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:00:05,342 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 18:00:05,363 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:00:05,363 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:00:05,365 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:00:05,365 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:00:05,365 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:00:05,366 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:00:05,366 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:00:05,366 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:00:05,366 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:00:05,366 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:00:05,367 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:00:05,367 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:00:05,368 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:00:05,368 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:00:05,369 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:00:05,370 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:00:05,370 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:00:05,370 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:00:05,370 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:00:05,370 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:00:05,371 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:00:05,371 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:00:05,371 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:00:05,371 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:00:05,371 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:00:05,372 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:00:05,372 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:00:05,372 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:00:05,372 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:00:05,373 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:00:05,373 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:00:05,373 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:00:05,373 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:00:05,373 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:00:05,374 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:00:05,374 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:00:05,374 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:00:05,374 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:00:05,374 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:00:05,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:00:05,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:00:05,429 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:00:05,431 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:00:05,432 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:00:05,433 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl [2018-12-03 18:00:05,433 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl' [2018-12-03 18:00:05,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:00:05,512 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:00:05,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:00:05,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:00:05,514 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:00:05,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/1) ... [2018-12-03 18:00:05,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/1) ... [2018-12-03 18:00:05,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:00:05,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:00:05,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:00:05,572 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:00:05,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/1) ... [2018-12-03 18:00:05,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/1) ... [2018-12-03 18:00:05,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/1) ... [2018-12-03 18:00:05,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/1) ... [2018-12-03 18:00:05,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/1) ... [2018-12-03 18:00:05,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/1) ... [2018-12-03 18:00:05,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/1) ... [2018-12-03 18:00:05,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:00:05,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:00:05,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:00:05,633 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:00:05,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (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 18:00:05,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 18:00:05,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 18:00:06,422 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 18:00:06,422 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 18:00:06,423 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:00:06 BoogieIcfgContainer [2018-12-03 18:00:06,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:00:06,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:00:06,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:00:06,427 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:00:06,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:00:05" (1/2) ... [2018-12-03 18:00:06,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@817d4ab and model type s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:00:06, skipping insertion in model container [2018-12-03 18:00:06,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:00:06" (2/2) ... [2018-12-03 18:00:06,431 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil.c_20.bpl [2018-12-03 18:00:06,442 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:00:06,451 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:00:06,465 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:00:06,501 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:00:06,502 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:00:06,502 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:00:06,502 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:00:06,502 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:00:06,502 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:00:06,503 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:00:06,503 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:00:06,520 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-12-03 18:00:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:00:06,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:06,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:06,532 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:06,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:06,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1912788263, now seen corresponding path program 1 times [2018-12-03 18:00:06,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:06,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:06,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:06,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:06,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:06,750 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 18:00:06,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:06,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:00:06,753 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:06,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:06,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:06,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:06,777 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-12-03 18:00:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:07,077 INFO L93 Difference]: Finished difference Result 41 states and 68 transitions. [2018-12-03 18:00:07,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:07,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 18:00:07,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:07,094 INFO L225 Difference]: With dead ends: 41 [2018-12-03 18:00:07,095 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 18:00:07,099 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 18:00:07,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 18:00:07,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 18:00:07,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 18:00:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2018-12-03 18:00:07,143 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 34 transitions. Word has length 10 [2018-12-03 18:00:07,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:07,144 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 34 transitions. [2018-12-03 18:00:07,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-12-03 18:00:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:00:07,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:07,145 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:07,146 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:07,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:07,146 INFO L82 PathProgramCache]: Analyzing trace with hash -694562177, now seen corresponding path program 1 times [2018-12-03 18:00:07,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:07,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:07,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:07,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:07,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:07,263 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 18:00:07,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:07,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:07,264 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:07,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:07,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:07,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:07,267 INFO L87 Difference]: Start difference. First operand 22 states and 34 transitions. Second operand 3 states. [2018-12-03 18:00:07,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:07,673 INFO L93 Difference]: Finished difference Result 45 states and 71 transitions. [2018-12-03 18:00:07,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:07,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-03 18:00:07,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:07,677 INFO L225 Difference]: With dead ends: 45 [2018-12-03 18:00:07,678 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 18:00:07,680 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 18:00:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 18:00:07,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 18:00:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 18:00:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2018-12-03 18:00:07,694 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 13 [2018-12-03 18:00:07,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:07,695 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2018-12-03 18:00:07,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2018-12-03 18:00:07,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 18:00:07,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:07,698 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:07,698 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:07,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:07,699 INFO L82 PathProgramCache]: Analyzing trace with hash 479561661, now seen corresponding path program 1 times [2018-12-03 18:00:07,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:07,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:07,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:07,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:07,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:07,855 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 18:00:07,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:07,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:07,858 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:07,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:07,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:07,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:07,859 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 3 states. [2018-12-03 18:00:08,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:08,030 INFO L93 Difference]: Finished difference Result 54 states and 81 transitions. [2018-12-03 18:00:08,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:08,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 18:00:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:08,033 INFO L225 Difference]: With dead ends: 54 [2018-12-03 18:00:08,034 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 18:00:08,034 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 18:00:08,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 18:00:08,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 18:00:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 18:00:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-12-03 18:00:08,054 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 17 [2018-12-03 18:00:08,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:08,054 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-12-03 18:00:08,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:08,055 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-12-03 18:00:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 18:00:08,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:08,056 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:08,057 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:08,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:08,057 INFO L82 PathProgramCache]: Analyzing trace with hash 2107505391, now seen corresponding path program 1 times [2018-12-03 18:00:08,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:08,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:08,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:08,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:08,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 18:00:08,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:08,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:08,197 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:08,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:08,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:08,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:08,198 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-12-03 18:00:08,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:08,392 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2018-12-03 18:00:08,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:08,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 18:00:08,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:08,394 INFO L225 Difference]: With dead ends: 65 [2018-12-03 18:00:08,394 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 18:00:08,395 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 18:00:08,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 18:00:08,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 18:00:08,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 18:00:08,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-12-03 18:00:08,402 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 22 [2018-12-03 18:00:08,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:08,402 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2018-12-03 18:00:08,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2018-12-03 18:00:08,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 18:00:08,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:08,404 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:08,404 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:08,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:08,405 INFO L82 PathProgramCache]: Analyzing trace with hash -2123032451, now seen corresponding path program 1 times [2018-12-03 18:00:08,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:08,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:08,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:08,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:08,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 18:00:08,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:08,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:08,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:08,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:08,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:08,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:08,547 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand 3 states. [2018-12-03 18:00:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:08,839 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2018-12-03 18:00:08,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:08,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 18:00:08,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:08,841 INFO L225 Difference]: With dead ends: 78 [2018-12-03 18:00:08,841 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 18:00:08,841 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 18:00:08,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 18:00:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 18:00:08,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 18:00:08,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-12-03 18:00:08,850 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 30 [2018-12-03 18:00:08,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:08,851 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-12-03 18:00:08,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:08,851 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-12-03 18:00:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 18:00:08,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:08,852 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:08,853 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:08,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:08,853 INFO L82 PathProgramCache]: Analyzing trace with hash -919972413, now seen corresponding path program 1 times [2018-12-03 18:00:08,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:08,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:08,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:08,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:08,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 18:00:08,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:08,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:08,940 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:08,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:08,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:08,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:08,942 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2018-12-03 18:00:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:08,989 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2018-12-03 18:00:08,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:08,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-03 18:00:08,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:08,991 INFO L225 Difference]: With dead ends: 94 [2018-12-03 18:00:08,991 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 18:00:08,992 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 18:00:08,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 18:00:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 18:00:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 18:00:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-12-03 18:00:09,002 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 39 [2018-12-03 18:00:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:09,002 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-12-03 18:00:09,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-12-03 18:00:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 18:00:09,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:09,004 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:09,005 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:09,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:09,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1178137851, now seen corresponding path program 1 times [2018-12-03 18:00:09,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:09,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:09,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:09,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:09,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:09,095 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 18:00:09,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:09,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:09,096 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:09,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:09,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:09,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:09,099 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 3 states. [2018-12-03 18:00:09,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:09,271 INFO L93 Difference]: Finished difference Result 75 states and 99 transitions. [2018-12-03 18:00:09,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:09,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-03 18:00:09,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:09,276 INFO L225 Difference]: With dead ends: 75 [2018-12-03 18:00:09,276 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 18:00:09,277 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 18:00:09,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 18:00:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-12-03 18:00:09,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 18:00:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 91 transitions. [2018-12-03 18:00:09,289 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 91 transitions. Word has length 39 [2018-12-03 18:00:09,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:09,290 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 91 transitions. [2018-12-03 18:00:09,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2018-12-03 18:00:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 18:00:09,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:09,292 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:09,292 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:09,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:09,293 INFO L82 PathProgramCache]: Analyzing trace with hash -497270587, now seen corresponding path program 1 times [2018-12-03 18:00:09,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:09,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:09,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:09,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:09,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:09,395 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 18:00:09,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:09,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:09,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:09,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:09,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:09,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:09,397 INFO L87 Difference]: Start difference. First operand 68 states and 91 transitions. Second operand 3 states. [2018-12-03 18:00:09,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:09,477 INFO L93 Difference]: Finished difference Result 134 states and 181 transitions. [2018-12-03 18:00:09,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:09,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-03 18:00:09,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:09,479 INFO L225 Difference]: With dead ends: 134 [2018-12-03 18:00:09,479 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 18:00:09,480 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 18:00:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 18:00:09,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 18:00:09,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 18:00:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2018-12-03 18:00:09,490 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 39 [2018-12-03 18:00:09,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:09,490 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2018-12-03 18:00:09,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2018-12-03 18:00:09,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 18:00:09,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:09,492 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:09,493 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:09,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:09,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1610522479, now seen corresponding path program 1 times [2018-12-03 18:00:09,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:09,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:09,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:09,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:09,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-03 18:00:09,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:09,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:09,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:09,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:09,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:09,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:09,607 INFO L87 Difference]: Start difference. First operand 69 states and 92 transitions. Second operand 3 states. [2018-12-03 18:00:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:10,081 INFO L93 Difference]: Finished difference Result 159 states and 225 transitions. [2018-12-03 18:00:10,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:10,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-03 18:00:10,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:10,083 INFO L225 Difference]: With dead ends: 159 [2018-12-03 18:00:10,084 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 18:00:10,084 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 18:00:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 18:00:10,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 18:00:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 18:00:10,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2018-12-03 18:00:10,098 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 56 [2018-12-03 18:00:10,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:10,099 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2018-12-03 18:00:10,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:10,099 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2018-12-03 18:00:10,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 18:00:10,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:10,101 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:10,101 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:10,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:10,101 INFO L82 PathProgramCache]: Analyzing trace with hash -919794, now seen corresponding path program 1 times [2018-12-03 18:00:10,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:10,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:10,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:10,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:10,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:10,201 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-03 18:00:10,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:10,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:10,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:10,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:10,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:10,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:10,204 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand 3 states. [2018-12-03 18:00:10,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:10,565 INFO L93 Difference]: Finished difference Result 199 states and 269 transitions. [2018-12-03 18:00:10,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:10,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-03 18:00:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:10,567 INFO L225 Difference]: With dead ends: 199 [2018-12-03 18:00:10,567 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 18:00:10,568 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 18:00:10,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 18:00:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 18:00:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 18:00:10,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 142 transitions. [2018-12-03 18:00:10,584 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 142 transitions. Word has length 68 [2018-12-03 18:00:10,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:10,585 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 142 transitions. [2018-12-03 18:00:10,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:10,585 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 142 transitions. [2018-12-03 18:00:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 18:00:10,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:10,587 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:10,588 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:10,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:10,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1962879724, now seen corresponding path program 1 times [2018-12-03 18:00:10,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:10,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:10,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:10,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:10,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-12-03 18:00:10,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:10,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:10,707 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:10,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:10,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:10,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:10,709 INFO L87 Difference]: Start difference. First operand 109 states and 142 transitions. Second operand 3 states. [2018-12-03 18:00:10,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:10,859 INFO L93 Difference]: Finished difference Result 233 states and 305 transitions. [2018-12-03 18:00:10,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:10,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-12-03 18:00:10,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:10,861 INFO L225 Difference]: With dead ends: 233 [2018-12-03 18:00:10,861 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 18:00:10,862 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 18:00:10,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 18:00:10,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-03 18:00:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 18:00:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 160 transitions. [2018-12-03 18:00:10,886 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 160 transitions. Word has length 77 [2018-12-03 18:00:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:10,886 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 160 transitions. [2018-12-03 18:00:10,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 160 transitions. [2018-12-03 18:00:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 18:00:10,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:10,890 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 6, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:10,890 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:10,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:10,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1866233676, now seen corresponding path program 1 times [2018-12-03 18:00:10,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:10,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:10,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:10,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:10,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-12-03 18:00:10,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:10,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:10,999 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:11,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:11,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:11,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:11,001 INFO L87 Difference]: Start difference. First operand 127 states and 160 transitions. Second operand 3 states. [2018-12-03 18:00:11,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:11,286 INFO L93 Difference]: Finished difference Result 271 states and 345 transitions. [2018-12-03 18:00:11,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:11,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-12-03 18:00:11,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:11,289 INFO L225 Difference]: With dead ends: 271 [2018-12-03 18:00:11,289 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 18:00:11,290 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 18:00:11,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 18:00:11,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-12-03 18:00:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 18:00:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 180 transitions. [2018-12-03 18:00:11,305 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 180 transitions. Word has length 86 [2018-12-03 18:00:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:11,306 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 180 transitions. [2018-12-03 18:00:11,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 180 transitions. [2018-12-03 18:00:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 18:00:11,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:11,308 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:11,308 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:11,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:11,309 INFO L82 PathProgramCache]: Analyzing trace with hash -82543983, now seen corresponding path program 1 times [2018-12-03 18:00:11,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:11,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:11,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:11,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:11,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-03 18:00:11,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:11,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:11,421 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:11,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:11,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:11,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:11,422 INFO L87 Difference]: Start difference. First operand 147 states and 180 transitions. Second operand 3 states. [2018-12-03 18:00:11,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:11,943 INFO L93 Difference]: Finished difference Result 313 states and 389 transitions. [2018-12-03 18:00:11,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:11,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-12-03 18:00:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:11,950 INFO L225 Difference]: With dead ends: 313 [2018-12-03 18:00:11,950 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 18:00:11,951 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 18:00:11,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 18:00:11,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-12-03 18:00:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-03 18:00:11,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 202 transitions. [2018-12-03 18:00:11,974 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 202 transitions. Word has length 96 [2018-12-03 18:00:11,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:11,975 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 202 transitions. [2018-12-03 18:00:11,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:11,975 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2018-12-03 18:00:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 18:00:11,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:11,977 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 10, 8, 6, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:11,977 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:11,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:11,978 INFO L82 PathProgramCache]: Analyzing trace with hash -666240887, now seen corresponding path program 1 times [2018-12-03 18:00:11,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:11,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:11,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:11,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:11,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-03 18:00:12,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:00:12,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:00:12,087 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:00:12,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:00:12,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:00:12,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:00:12,088 INFO L87 Difference]: Start difference. First operand 169 states and 202 transitions. Second operand 3 states. [2018-12-03 18:00:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:12,386 INFO L93 Difference]: Finished difference Result 359 states and 445 transitions. [2018-12-03 18:00:12,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:00:12,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-12-03 18:00:12,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:12,389 INFO L225 Difference]: With dead ends: 359 [2018-12-03 18:00:12,389 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 18:00:12,390 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 18:00:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 18:00:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-12-03 18:00:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-03 18:00:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2018-12-03 18:00:12,406 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 107 [2018-12-03 18:00:12,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:12,406 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2018-12-03 18:00:12,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:00:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2018-12-03 18:00:12,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 18:00:12,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:12,408 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 9, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:00:12,409 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:12,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:12,409 INFO L82 PathProgramCache]: Analyzing trace with hash 133203942, now seen corresponding path program 1 times [2018-12-03 18:00:12,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:12,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:12,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:12,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:12,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 282 proven. 6 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-03 18:00:12,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:00:12,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:00:12,544 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2018-12-03 18:00:12,547 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [42], [46], [48], [52], [54], [56], [60], [62], [66], [68], [70], [75], [77], [81], [83], [87], [89] [2018-12-03 18:00:12,609 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:00:12,609 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:00:20,602 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 18:06:36,195 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:06:36,196 INFO L272 AbstractInterpreter]: Visited 32 different actions 1631 times. Merged at 29 different actions 977 times. Widened at 23 different actions 691 times. Found 589 fixpoints after 20 different actions. Largest state had 0 variables. [2018-12-03 18:06:36,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:36,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:06:36,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:36,209 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 18:06:36,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:06:36,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:06:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:36,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:06:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 282 proven. 6 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-03 18:06:36,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:06:36,567 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 282 proven. 6 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-03 18:06:36,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:06:36,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 18:06:36,607 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:06:36,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:06:36,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:06:36,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:06:36,608 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand 4 states. [2018-12-03 18:06:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:06:37,365 INFO L93 Difference]: Finished difference Result 371 states and 424 transitions. [2018-12-03 18:06:37,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:06:37,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-12-03 18:06:37,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:06:37,367 INFO L225 Difference]: With dead ends: 371 [2018-12-03 18:06:37,367 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 18:06:37,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 237 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 18:06:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 18:06:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 18:06:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 18:06:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 18:06:37,372 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2018-12-03 18:06:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:06:37,372 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 18:06:37,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:06:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 18:06:37,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 18:06:37,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 18:06:37,901 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-12-03 18:06:38,067 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-12-03 18:06:38,453 INFO L444 ceAbstractionStarter]: At program point L506(lines 289 506) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-12-03 18:06:38,453 INFO L444 ceAbstractionStarter]: At program point L374(lines 374 397) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-12-03 18:06:38,453 INFO L444 ceAbstractionStarter]: At program point L370(lines 370 386) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) [2018-12-03 18:06:38,454 INFO L444 ceAbstractionStarter]: At program point L337(lines 337 348) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-12-03 18:06:38,454 INFO L444 ceAbstractionStarter]: At program point L300(lines 261 300) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-12-03 18:06:38,454 INFO L444 ceAbstractionStarter]: At program point L362(lines 357 375) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4400) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) [2018-12-03 18:06:38,454 INFO L444 ceAbstractionStarter]: At program point L296(lines 296 316) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-12-03 18:06:38,454 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 507) no Hoare annotation was computed. [2018-12-03 18:06:38,454 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 507) no Hoare annotation was computed. [2018-12-03 18:06:38,455 INFO L444 ceAbstractionStarter]: At program point L412(lines 412 439) the Hoare annotation is: false [2018-12-03 18:06:38,455 INFO L444 ceAbstractionStarter]: At program point L441(lines 438 455) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-12-03 18:06:38,455 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 440) no Hoare annotation was computed. [2018-12-03 18:06:38,455 INFO L444 ceAbstractionStarter]: At program point L400(lines 400 431) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-12-03 18:06:38,455 INFO L444 ceAbstractionStarter]: At program point L396(lines 396 413) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) [2018-12-03 18:06:38,455 INFO L444 ceAbstractionStarter]: At program point L388(lines 385 401) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) [2018-12-03 18:06:38,456 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 507) no Hoare annotation was computed. [2018-12-03 18:06:38,456 INFO L444 ceAbstractionStarter]: At program point L351(lines 351 371) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-12-03 18:06:38,456 INFO L444 ceAbstractionStarter]: At program point L347(lines 347 358) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) [2018-12-03 18:06:38,456 INFO L444 ceAbstractionStarter]: At program point L480(lines 480 497) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-12-03 18:06:38,456 INFO L444 ceAbstractionStarter]: At program point L319(lines 319 334) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-12-03 18:06:38,456 INFO L444 ceAbstractionStarter]: At program point L460(lines 460 477) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-12-03 18:06:38,456 INFO L444 ceAbstractionStarter]: At program point L266(lines 266 290) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-12-03 18:06:38,469 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:06:38 BoogieIcfgContainer [2018-12-03 18:06:38,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 18:06:38,470 INFO L168 Benchmark]: Toolchain (without parser) took 392959.88 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 35.3 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-12-03 18:06:38,472 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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 18:06:38,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.56 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 18:06:38,473 INFO L168 Benchmark]: Boogie Preprocessor took 61.05 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 18:06:38,473 INFO L168 Benchmark]: RCFGBuilder took 790.08 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 18:06:38,474 INFO L168 Benchmark]: TraceAbstraction took 392045.27 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -7.0 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-12-03 18:06:38,478 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.23 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 57.56 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 61.05 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 790.08 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 392045.27 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -7.0 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 440]: 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: 385]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416 - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 396]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432 - InvariantResult [Line: 460]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || ssl3_connect_~s__state~4 == 4368) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~4 == 4400 && ssl3_connect_~blastFlag~4 == 3 - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || ssl3_connect_~s__state~4 == 4368) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || ssl3_connect_~s__state~4 == 4368) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400 - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || ssl3_connect_~s__state~4 == 4368) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. SAFE Result, 391.9s OverallTime, 15 OverallIterations, 14 TraceHistogramMax, 4.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 478 SDtfs, 60 SDslu, 167 SDs, 0 SdLazy, 428 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 383.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 198 NumberOfFragments, 390 HoareAnnotationTreeSize, 18 FomulaSimplifications, 1407 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 18 FomulaSimplificationsInter, 168 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 937 NumberOfCodeBlocks, 937 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1039 ConstructedInterpolants, 0 QuantifiedInterpolants, 112475 SizeOfPredicates, 2 NumberOfNonLiveVariables, 567 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 3484/3502 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...