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_1.cil.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:59:31,251 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:59:31,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:59:31,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:59:31,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:59:31,269 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:59:31,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:59:31,272 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:59:31,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:59:31,275 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:59:31,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:59:31,276 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:59:31,277 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:59:31,278 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:59:31,279 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:59:31,280 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:59:31,281 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:59:31,283 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:59:31,285 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:59:31,287 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:59:31,288 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:59:31,289 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:59:31,292 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:59:31,292 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:59:31,293 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:59:31,294 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:59:31,295 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:59:31,296 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:59:31,296 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:59:31,298 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:59:31,298 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:59:31,299 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:59:31,299 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:59:31,299 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:59:31,300 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:59:31,301 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:59:31,301 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 17:59:31,317 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:59:31,317 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:59:31,318 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:59:31,319 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:59:31,319 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:59:31,319 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:59:31,319 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:59:31,319 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:59:31,320 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:59:31,320 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:59:31,320 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:59:31,320 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:59:31,320 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:59:31,321 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:59:31,321 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:59:31,322 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:59:31,322 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:59:31,322 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:59:31,322 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:59:31,323 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:59:31,323 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:59:31,323 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:59:31,323 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:59:31,323 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:59:31,324 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:59:31,324 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:59:31,324 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:59:31,324 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:59:31,324 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:59:31,325 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:59:31,325 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:59:31,325 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:59:31,325 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:59:31,325 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:59:31,326 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:59:31,326 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:59:31,326 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:59:31,326 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:59:31,327 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:59:31,359 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:59:31,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:59:31,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:59:31,379 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:59:31,380 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:59:31,381 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl [2018-12-03 17:59:31,381 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl' [2018-12-03 17:59:31,464 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:59:31,468 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:59:31,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:59:31,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:59:31,469 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:59:31,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:31" (1/1) ... [2018-12-03 17:59:31,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:31" (1/1) ... [2018-12-03 17:59:31,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:59:31,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:59:31,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:59:31,531 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:59:31,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:31" (1/1) ... [2018-12-03 17:59:31,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:31" (1/1) ... [2018-12-03 17:59:31,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:31" (1/1) ... [2018-12-03 17:59:31,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:31" (1/1) ... [2018-12-03 17:59:31,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:31" (1/1) ... [2018-12-03 17:59:31,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:31" (1/1) ... [2018-12-03 17:59:31,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:31" (1/1) ... [2018-12-03 17:59:31,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:59:31,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:59:31,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:59:31,572 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:59:31,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:31" (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 17:59:31,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:59:31,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:59:32,316 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:59:32,317 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:59:32,317 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:59:32 BoogieIcfgContainer [2018-12-03 17:59:32,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:59:32,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:59:32,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:59:32,324 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:59:32,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:59:31" (1/2) ... [2018-12-03 17:59:32,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c46f48 and model type s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:59:32, skipping insertion in model container [2018-12-03 17:59:32,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:59:32" (2/2) ... [2018-12-03 17:59:32,329 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil.c_16.bpl [2018-12-03 17:59:32,341 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:59:32,350 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:59:32,366 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:59:32,409 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:59:32,409 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:59:32,409 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:59:32,410 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:59:32,411 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:59:32,411 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:59:32,411 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:59:32,411 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:59:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-12-03 17:59:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:59:32,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:32,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:32,448 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:32,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:32,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1912595551, now seen corresponding path program 1 times [2018-12-03 17:59:32,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:32,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:32,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:32,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:32,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:32,679 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 17:59:32,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:32,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:59:32,683 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:32,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:32,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:32,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:32,708 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-12-03 17:59:32,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:32,891 INFO L93 Difference]: Finished difference Result 33 states and 56 transitions. [2018-12-03 17:59:32,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:32,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 17:59:32,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:32,908 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:59:32,908 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 17:59:32,913 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 17:59:32,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 17:59:32,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 17:59:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:59:32,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2018-12-03 17:59:32,950 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 10 [2018-12-03 17:59:32,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:32,951 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-12-03 17:59:32,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2018-12-03 17:59:32,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:59:32,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:32,952 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:32,953 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:32,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:32,954 INFO L82 PathProgramCache]: Analyzing trace with hash -694754889, now seen corresponding path program 1 times [2018-12-03 17:59:32,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:32,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:32,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:32,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:32,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:33,036 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 17:59:33,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:33,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:59:33,038 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:33,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:33,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:33,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:33,041 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 3 states. [2018-12-03 17:59:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:33,230 INFO L93 Difference]: Finished difference Result 37 states and 59 transitions. [2018-12-03 17:59:33,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:33,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-03 17:59:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:33,232 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:59:33,233 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 17:59:33,234 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 17:59:33,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 17:59:33,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 17:59:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 17:59:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-12-03 17:59:33,242 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 13 [2018-12-03 17:59:33,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:33,242 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-12-03 17:59:33,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-12-03 17:59:33,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:59:33,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:33,244 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:33,244 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:33,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:33,245 INFO L82 PathProgramCache]: Analyzing trace with hash 479368949, now seen corresponding path program 1 times [2018-12-03 17:59:33,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:33,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:33,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:33,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:33,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:33,399 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 17:59:33,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:33,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:59:33,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:33,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:33,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:33,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:33,405 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-12-03 17:59:33,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:33,710 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2018-12-03 17:59:33,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:33,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 17:59:33,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:33,713 INFO L225 Difference]: With dead ends: 46 [2018-12-03 17:59:33,714 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:59:33,714 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 17:59:33,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:59:33,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 17:59:33,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 17:59:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-03 17:59:33,729 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 17 [2018-12-03 17:59:33,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:33,731 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-03 17:59:33,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-03 17:59:33,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 17:59:33,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:33,734 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:33,734 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:33,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:33,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2107312679, now seen corresponding path program 1 times [2018-12-03 17:59:33,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:33,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:33,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:33,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:33,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:33,890 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 17:59:33,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:33,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:59:33,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:33,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:33,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:33,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:33,893 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-12-03 17:59:34,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:34,116 INFO L93 Difference]: Finished difference Result 57 states and 81 transitions. [2018-12-03 17:59:34,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:34,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 17:59:34,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:34,119 INFO L225 Difference]: With dead ends: 57 [2018-12-03 17:59:34,119 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:59:34,120 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 17:59:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:59:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 17:59:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 17:59:34,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2018-12-03 17:59:34,127 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 22 [2018-12-03 17:59:34,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:34,127 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-12-03 17:59:34,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:34,128 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2018-12-03 17:59:34,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 17:59:34,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:34,129 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:34,129 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:34,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:34,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1908478443, now seen corresponding path program 1 times [2018-12-03 17:59:34,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:34,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:34,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:34,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:34,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:34,277 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 17:59:34,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:34,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:59:34,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:34,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:34,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:34,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:34,281 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 3 states. [2018-12-03 17:59:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:34,443 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2018-12-03 17:59:34,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:34,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-03 17:59:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:34,445 INFO L225 Difference]: With dead ends: 70 [2018-12-03 17:59:34,445 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 17:59:34,446 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 17:59:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 17:59:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 17:59:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 17:59:34,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2018-12-03 17:59:34,455 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 28 [2018-12-03 17:59:34,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:34,456 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2018-12-03 17:59:34,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:34,456 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2018-12-03 17:59:34,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 17:59:34,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:34,458 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:34,458 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:34,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:34,459 INFO L82 PathProgramCache]: Analyzing trace with hash 685039927, now seen corresponding path program 1 times [2018-12-03 17:59:34,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:34,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:34,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:34,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:34,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:34,564 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 17:59:34,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:34,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:59:34,565 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:34,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:34,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:34,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:34,568 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 3 states. [2018-12-03 17:59:34,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:34,633 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2018-12-03 17:59:34,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:34,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-03 17:59:34,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:34,635 INFO L225 Difference]: With dead ends: 59 [2018-12-03 17:59:34,636 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 17:59:34,636 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 17:59:34,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 17:59:34,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-12-03 17:59:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 17:59:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2018-12-03 17:59:34,647 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 35 [2018-12-03 17:59:34,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:34,648 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2018-12-03 17:59:34,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:34,648 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2018-12-03 17:59:34,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 17:59:34,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:34,649 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:34,650 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:34,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:34,650 INFO L82 PathProgramCache]: Analyzing trace with hash -82130889, now seen corresponding path program 1 times [2018-12-03 17:59:34,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:34,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:34,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:34,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:34,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:34,728 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 17:59:34,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:34,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:59:34,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:34,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:34,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:34,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:34,731 INFO L87 Difference]: Start difference. First operand 53 states and 73 transitions. Second operand 3 states. [2018-12-03 17:59:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:34,874 INFO L93 Difference]: Finished difference Result 111 states and 157 transitions. [2018-12-03 17:59:34,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:34,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-03 17:59:34,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:34,877 INFO L225 Difference]: With dead ends: 111 [2018-12-03 17:59:34,877 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 17:59:34,878 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 17:59:34,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 17:59:34,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 17:59:34,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 17:59:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2018-12-03 17:59:34,889 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 44 [2018-12-03 17:59:34,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:34,890 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2018-12-03 17:59:34,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:34,890 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2018-12-03 17:59:34,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 17:59:34,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:34,892 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:34,892 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:34,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:34,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1942977721, now seen corresponding path program 1 times [2018-12-03 17:59:34,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:34,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:34,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:34,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:34,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:34,993 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-03 17:59:34,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:34,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:59:34,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:34,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:34,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:34,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:34,996 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand 3 states. [2018-12-03 17:59:35,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:35,156 INFO L93 Difference]: Finished difference Result 143 states and 203 transitions. [2018-12-03 17:59:35,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:35,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-03 17:59:35,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:35,158 INFO L225 Difference]: With dead ends: 143 [2018-12-03 17:59:35,158 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 17:59:35,159 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 17:59:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 17:59:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 17:59:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 17:59:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-12-03 17:59:35,175 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 53 [2018-12-03 17:59:35,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:35,175 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-12-03 17:59:35,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-12-03 17:59:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 17:59:35,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:35,177 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:35,178 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:35,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:35,178 INFO L82 PathProgramCache]: Analyzing trace with hash 138737266, now seen corresponding path program 1 times [2018-12-03 17:59:35,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:35,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:35,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:35,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:35,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-03 17:59:35,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:35,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:59:35,295 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:35,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:35,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:35,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:35,296 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-12-03 17:59:35,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:35,646 INFO L93 Difference]: Finished difference Result 177 states and 231 transitions. [2018-12-03 17:59:35,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:35,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-03 17:59:35,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:35,650 INFO L225 Difference]: With dead ends: 177 [2018-12-03 17:59:35,650 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 17:59:35,652 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 17:59:35,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 17:59:35,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 17:59:35,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 17:59:35,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2018-12-03 17:59:35,667 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 65 [2018-12-03 17:59:35,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:35,668 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2018-12-03 17:59:35,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:35,668 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2018-12-03 17:59:35,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 17:59:35,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:35,670 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:35,670 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:35,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:35,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1273491131, now seen corresponding path program 1 times [2018-12-03 17:59:35,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:35,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:35,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:35,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:35,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-03 17:59:35,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:35,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:59:35,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:35,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:35,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:35,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:35,782 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand 3 states. [2018-12-03 17:59:36,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:36,262 INFO L93 Difference]: Finished difference Result 209 states and 267 transitions. [2018-12-03 17:59:36,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:36,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-12-03 17:59:36,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:36,265 INFO L225 Difference]: With dead ends: 209 [2018-12-03 17:59:36,265 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 17:59:36,266 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 17:59:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 17:59:36,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-03 17:59:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 17:59:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2018-12-03 17:59:36,283 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 75 [2018-12-03 17:59:36,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:36,284 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2018-12-03 17:59:36,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:36,285 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2018-12-03 17:59:36,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 17:59:36,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:36,287 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:36,288 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:36,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:36,288 INFO L82 PathProgramCache]: Analyzing trace with hash 739368033, now seen corresponding path program 1 times [2018-12-03 17:59:36,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:36,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:36,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:36,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:36,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-03 17:59:36,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:59:36,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:59:36,420 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:59:36,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:59:36,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:59:36,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:59:36,423 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 3 states. [2018-12-03 17:59:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:59:36,795 INFO L93 Difference]: Finished difference Result 255 states and 327 transitions. [2018-12-03 17:59:36,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:59:36,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-12-03 17:59:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:59:36,800 INFO L225 Difference]: With dead ends: 255 [2018-12-03 17:59:36,800 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 17:59:36,802 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 17:59:36,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 17:59:36,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-12-03 17:59:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 17:59:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 167 transitions. [2018-12-03 17:59:36,837 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 167 transitions. Word has length 86 [2018-12-03 17:59:36,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:59:36,837 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 167 transitions. [2018-12-03 17:59:36,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:59:36,838 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2018-12-03 17:59:36,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 17:59:36,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:59:36,848 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:59:36,848 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:59:36,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:59:36,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1128890468, now seen corresponding path program 1 times [2018-12-03 17:59:36,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:59:36,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:36,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:59:36,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:59:36,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:59:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:59:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 139 proven. 8 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-03 17:59:37,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:59:37,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:59:37,039 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2018-12-03 17:59:37,041 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [44], [46], [50], [52], [54], [59], [61], [65], [67], [71], [73] [2018-12-03 17:59:37,117 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:59:37,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:00:07,925 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 18:03:49,987 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:03:49,989 INFO L272 AbstractInterpreter]: Visited 26 different actions 936 times. Merged at 25 different actions 539 times. Widened at 23 different actions 425 times. Found 347 fixpoints after 15 different actions. Largest state had 0 variables. [2018-12-03 18:03:50,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:03:50,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:03:50,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:03:50,006 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:03:50,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:03:50,020 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:03:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:03:50,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:03:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 139 proven. 8 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-03 18:03:50,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:03:50,411 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 139 proven. 8 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-03 18:03:50,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:03:50,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 18:03:50,452 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:03:50,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:03:50,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:03:50,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:03:50,453 INFO L87 Difference]: Start difference. First operand 141 states and 167 transitions. Second operand 4 states. [2018-12-03 18:03:50,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:03:50,941 INFO L93 Difference]: Finished difference Result 387 states and 465 transitions. [2018-12-03 18:03:50,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:03:50,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-03 18:03:50,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:03:50,942 INFO L225 Difference]: With dead ends: 387 [2018-12-03 18:03:50,942 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 18:03:50,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:03:50,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 18:03:50,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 18:03:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 18:03:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 18:03:50,944 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2018-12-03 18:03:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:03:50,945 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 18:03:50,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:03:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 18:03:50,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 18:03:50,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 18:03:51,409 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-12-03 18:03:51,793 WARN L180 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-12-03 18:03:51,964 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-12-03 18:03:52,243 INFO L444 ceAbstractionStarter]: At program point L353(lines 353 368) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 18:03:52,243 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 419) no Hoare annotation was computed. [2018-12-03 18:03:52,243 INFO L444 ceAbstractionStarter]: At program point L420(lines 417 434) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 18:03:52,244 INFO L444 ceAbstractionStarter]: At program point L383(lines 383 410) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 18:03:52,244 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 486) no Hoare annotation was computed. [2018-12-03 18:03:52,244 INFO L444 ceAbstractionStarter]: At program point L317(lines 317 332) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 18:03:52,244 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 486) no Hoare annotation was computed. [2018-12-03 18:03:52,244 INFO L444 ceAbstractionStarter]: At program point L379(lines 379 390) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) [2018-12-03 18:03:52,244 INFO L444 ceAbstractionStarter]: At program point L371(lines 371 380) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 18:03:52,244 INFO L444 ceAbstractionStarter]: At program point L264(lines 264 288) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 18:03:52,245 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 486) no Hoare annotation was computed. [2018-12-03 18:03:52,245 INFO L444 ceAbstractionStarter]: At program point L335(lines 335 350) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 18:03:52,245 INFO L444 ceAbstractionStarter]: At program point L459(lines 459 476) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 18:03:52,245 INFO L444 ceAbstractionStarter]: At program point L298(lines 259 298) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 18:03:52,245 INFO L444 ceAbstractionStarter]: At program point L294(lines 294 314) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 18:03:52,245 INFO L444 ceAbstractionStarter]: At program point L389(lines 389 418) the Hoare annotation is: false [2018-12-03 18:03:52,245 INFO L444 ceAbstractionStarter]: At program point L439(lines 439 456) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 18:03:52,246 INFO L444 ceAbstractionStarter]: At program point L485(lines 287 485) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-12-03 18:03:52,256 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:03:52 BoogieIcfgContainer [2018-12-03 18:03:52,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 18:03:52,257 INFO L168 Benchmark]: Toolchain (without parser) took 260791.94 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 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-12-03 18:03:52,259 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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:03:52,259 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.91 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:03:52,260 INFO L168 Benchmark]: Boogie Preprocessor took 40.17 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:03:52,260 INFO L168 Benchmark]: RCFGBuilder took 745.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 18:03:52,261 INFO L168 Benchmark]: TraceAbstraction took 259937.59 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 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-12-03 18:03:52,265 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.25 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 61.91 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 40.17 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 745.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 259937.59 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 2.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 419]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 417]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4368 || ssl3_connect_~blastFlag~4 <= 4) || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4368 || ssl3_connect_~blastFlag~4 <= 4) || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4368 || ssl3_connect_~blastFlag~4 <= 4) || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432 - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4368 || ssl3_connect_~blastFlag~4 <= 4) || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 259.8s OverallTime, 12 OverallIterations, 12 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 318 SDtfs, 36 SDslu, 67 SDs, 0 SdLazy, 361 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 252.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 262 NumberOfFragments, 188 HoareAnnotationTreeSize, 14 FomulaSimplifications, 1789 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 84 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 644 NumberOfCodeBlocks, 644 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 728 ConstructedInterpolants, 0 QuantifiedInterpolants, 71346 SizeOfPredicates, 2 NumberOfNonLiveVariables, 506 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 2239/2263 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...