java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:49:41,673 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:49:41,675 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:49:41,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:49:41,687 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:49:41,689 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:49:41,690 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:49:41,692 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:49:41,694 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:49:41,695 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:49:41,699 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:49:41,699 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:49:41,700 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:49:41,704 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:49:41,705 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:49:41,710 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:49:41,715 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:49:41,717 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:49:41,719 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:49:41,721 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:49:41,722 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:49:41,724 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:49:41,726 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:49:41,726 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:49:41,727 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:49:41,728 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:49:41,729 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:49:41,730 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:49:41,731 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:49:41,732 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:49:41,732 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:49:41,733 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:49:41,733 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:49:41,734 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:49:41,735 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:49:41,735 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:49:41,736 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:49:41,750 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:49:41,750 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:49:41,751 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:49:41,752 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:49:41,752 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:49:41,752 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:49:41,752 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:49:41,752 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:49:41,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:49:41,833 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:49:41,840 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:49:41,842 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:49:41,843 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:49:41,844 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl [2018-07-23 13:49:41,844 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl' [2018-07-23 13:49:41,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:49:41,976 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:49:41,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:49:41,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:49:41,979 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:49:42,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:41" (1/1) ... [2018-07-23 13:49:42,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:41" (1/1) ... [2018-07-23 13:49:42,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:41" (1/1) ... [2018-07-23 13:49:42,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:41" (1/1) ... [2018-07-23 13:49:42,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:41" (1/1) ... [2018-07-23 13:49:42,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:41" (1/1) ... [2018-07-23 13:49:42,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:41" (1/1) ... [2018-07-23 13:49:42,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:49:42,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:49:42,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:49:42,078 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:49:42,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:41" (1/1) ... [2018-07-23 13:49:42,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:49:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:49:42,738 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:49:42,739 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:42 BoogieIcfgContainer [2018-07-23 13:49:42,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:49:42,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:49:42,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:49:42,746 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:49:42,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:41" (1/2) ... [2018-07-23 13:49:42,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45aa529d and model type s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:49:42, skipping insertion in model container [2018-07-23 13:49:42,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:42" (2/2) ... [2018-07-23 13:49:42,754 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil.c_19.bpl [2018-07-23 13:49:42,765 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:49:42,773 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:49:42,819 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:49:42,820 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:49:42,820 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:49:42,820 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:49:42,821 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:49:42,821 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:49:42,821 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:49:42,821 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:49:42,821 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:49:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-07-23 13:49:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:49:42,847 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:42,848 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:42,848 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:42,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1918382949, now seen corresponding path program 1 times [2018-07-23 13:49:42,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:42,997 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:42,998 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:49:43,000 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:43,002 INFO L185 omatonBuilderFactory]: Interpolants [17#true, 18#false, 19#(= ULTIMATE.start_ssl3_connect_~s__state~3 12292)] [2018-07-23 13:49:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:43,004 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:43,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:43,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:43,024 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-07-23 13:49:43,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:43,098 INFO L93 Difference]: Finished difference Result 29 states and 46 transitions. [2018-07-23 13:49:43,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:43,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-07-23 13:49:43,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:43,127 INFO L225 Difference]: With dead ends: 29 [2018-07-23 13:49:43,129 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:49:43,137 INFO L575 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-07-23 13:49:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:49:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 13:49:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 13:49:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-07-23 13:49:43,188 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 10 [2018-07-23 13:49:43,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:43,188 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-07-23 13:49:43,188 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2018-07-23 13:49:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:49:43,191 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:43,191 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:43,192 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:43,192 INFO L82 PathProgramCache]: Analyzing trace with hash -688967491, now seen corresponding path program 1 times [2018-07-23 13:49:43,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:43,221 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:43,221 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:43,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:43,222 INFO L185 omatonBuilderFactory]: Interpolants [112#(= ULTIMATE.start_ssl3_connect_~s__state~3 4368), 110#true, 111#false] [2018-07-23 13:49:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:43,224 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:43,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:43,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:43,225 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 3 states. [2018-07-23 13:49:43,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:43,287 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2018-07-23 13:49:43,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:43,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-07-23 13:49:43,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:43,289 INFO L225 Difference]: With dead ends: 33 [2018-07-23 13:49:43,289 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 13:49:43,290 INFO L575 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-07-23 13:49:43,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 13:49:43,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-23 13:49:43,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-23 13:49:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-07-23 13:49:43,301 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 13 [2018-07-23 13:49:43,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:43,302 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-07-23 13:49:43,302 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-07-23 13:49:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:49:43,305 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:43,305 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:43,306 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:43,306 INFO L82 PathProgramCache]: Analyzing trace with hash 485156347, now seen corresponding path program 1 times [2018-07-23 13:49:43,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:49:43,363 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:43,364 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:43,364 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:43,365 INFO L185 omatonBuilderFactory]: Interpolants [219#true, 220#false, 221#(= ULTIMATE.start_ssl3_connect_~s__state~3 4384)] [2018-07-23 13:49:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:49:43,365 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:43,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:43,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:43,366 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 3 states. [2018-07-23 13:49:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:43,405 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2018-07-23 13:49:43,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:43,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-07-23 13:49:43,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:43,408 INFO L225 Difference]: With dead ends: 42 [2018-07-23 13:49:43,408 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 13:49:43,409 INFO L575 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-07-23 13:49:43,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 13:49:43,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-23 13:49:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 13:49:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-07-23 13:49:43,414 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 17 [2018-07-23 13:49:43,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:43,415 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-07-23 13:49:43,415 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2018-07-23 13:49:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:49:43,416 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:43,416 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:43,417 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:43,417 INFO L82 PathProgramCache]: Analyzing trace with hash -521572625, now seen corresponding path program 1 times [2018-07-23 13:49:43,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:49:43,464 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:43,467 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:49:43,468 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:43,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:43,469 INFO L185 omatonBuilderFactory]: Interpolants [356#true, 357#false, 358#(= ULTIMATE.start_ssl3_connect_~blastFlag~3 1), 359#(not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5))] [2018-07-23 13:49:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:49:43,469 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:43,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:43,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:43,472 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 4 states. [2018-07-23 13:49:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:43,528 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2018-07-23 13:49:43,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:43,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-07-23 13:49:43,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:43,530 INFO L225 Difference]: With dead ends: 42 [2018-07-23 13:49:43,530 INFO L226 Difference]: Without dead ends: 40 [2018-07-23 13:49:43,532 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:43,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-23 13:49:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-07-23 13:49:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-23 13:49:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2018-07-23 13:49:43,555 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 22 [2018-07-23 13:49:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:43,555 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2018-07-23 13:49:43,556 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2018-07-23 13:49:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-23 13:49:43,560 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:43,560 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:43,560 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:43,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1625399685, now seen corresponding path program 2 times [2018-07-23 13:49:43,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:49:43,615 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:43,615 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:49:43,615 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:43,616 INFO L185 omatonBuilderFactory]: Interpolants [516#true, 517#false, 518#(= ULTIMATE.start_ssl3_connect_~blastFlag~3 1), 519#(<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2), 520#(not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5))] [2018-07-23 13:49:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:49:43,617 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:49:43,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:49:43,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:43,618 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 5 states. [2018-07-23 13:49:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:43,681 INFO L93 Difference]: Finished difference Result 99 states and 142 transitions. [2018-07-23 13:49:43,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:49:43,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-07-23 13:49:43,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:43,683 INFO L225 Difference]: With dead ends: 99 [2018-07-23 13:49:43,683 INFO L226 Difference]: Without dead ends: 66 [2018-07-23 13:49:43,684 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:43,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-23 13:49:43,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2018-07-23 13:49:43,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-23 13:49:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2018-07-23 13:49:43,709 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 27 [2018-07-23 13:49:43,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:43,710 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2018-07-23 13:49:43,710 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:49:43,713 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2018-07-23 13:49:43,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-23 13:49:43,715 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:43,715 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:43,715 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:43,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1667542513, now seen corresponding path program 1 times [2018-07-23 13:49:43,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:43,757 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-07-23 13:49:43,759 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:43,759 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:43,759 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:43,760 INFO L185 omatonBuilderFactory]: Interpolants [813#true, 814#false, 815#(<= 4416 ULTIMATE.start_ssl3_connect_~s__state~3)] [2018-07-23 13:49:43,763 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-07-23 13:49:43,763 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:43,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:43,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:43,764 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand 3 states. [2018-07-23 13:49:43,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:43,831 INFO L93 Difference]: Finished difference Result 121 states and 181 transitions. [2018-07-23 13:49:43,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:43,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-07-23 13:49:43,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:43,834 INFO L225 Difference]: With dead ends: 121 [2018-07-23 13:49:43,834 INFO L226 Difference]: Without dead ends: 77 [2018-07-23 13:49:43,838 INFO L575 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-07-23 13:49:43,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-23 13:49:43,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2018-07-23 13:49:43,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 13:49:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2018-07-23 13:49:43,861 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 33 [2018-07-23 13:49:43,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:43,861 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2018-07-23 13:49:43,862 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:43,862 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2018-07-23 13:49:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-23 13:49:43,864 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:43,864 INFO L357 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:43,865 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:43,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1819540512, now seen corresponding path program 1 times [2018-07-23 13:49:43,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-07-23 13:49:43,926 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:43,927 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:43,927 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:43,931 INFO L185 omatonBuilderFactory]: Interpolants [1188#true, 1189#false, 1190#(= ULTIMATE.start_ssl3_connect_~s__state~3 4416)] [2018-07-23 13:49:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-07-23 13:49:43,932 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:43,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:43,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:43,933 INFO L87 Difference]: Start difference. First operand 65 states and 88 transitions. Second operand 3 states. [2018-07-23 13:49:43,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:43,982 INFO L93 Difference]: Finished difference Result 134 states and 182 transitions. [2018-07-23 13:49:43,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:43,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-07-23 13:49:43,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:43,985 INFO L225 Difference]: With dead ends: 134 [2018-07-23 13:49:43,985 INFO L226 Difference]: Without dead ends: 72 [2018-07-23 13:49:43,988 INFO L575 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-07-23 13:49:43,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-23 13:49:43,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-23 13:49:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-23 13:49:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2018-07-23 13:49:44,001 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 43 [2018-07-23 13:49:44,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:44,002 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2018-07-23 13:49:44,002 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2018-07-23 13:49:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-23 13:49:44,004 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:44,004 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:44,005 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:44,005 INFO L82 PathProgramCache]: Analyzing trace with hash 992798050, now seen corresponding path program 1 times [2018-07-23 13:49:44,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-07-23 13:49:44,050 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:44,050 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:44,051 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:44,051 INFO L185 omatonBuilderFactory]: Interpolants [1603#true, 1604#false, 1605#(= ULTIMATE.start_ssl3_connect_~s__state~3 4432)] [2018-07-23 13:49:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-07-23 13:49:44,052 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:44,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:44,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:44,053 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand 3 states. [2018-07-23 13:49:44,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:44,084 INFO L93 Difference]: Finished difference Result 149 states and 198 transitions. [2018-07-23 13:49:44,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:44,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-07-23 13:49:44,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:44,086 INFO L225 Difference]: With dead ends: 149 [2018-07-23 13:49:44,086 INFO L226 Difference]: Without dead ends: 80 [2018-07-23 13:49:44,087 INFO L575 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-07-23 13:49:44,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-23 13:49:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-23 13:49:44,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-23 13:49:44,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 103 transitions. [2018-07-23 13:49:44,100 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 103 transitions. Word has length 50 [2018-07-23 13:49:44,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:44,101 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 103 transitions. [2018-07-23 13:49:44,101 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:44,101 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 103 transitions. [2018-07-23 13:49:44,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-23 13:49:44,102 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:44,103 INFO L357 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:44,103 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:44,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1242467222, now seen corresponding path program 1 times [2018-07-23 13:49:44,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:44,145 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-07-23 13:49:44,146 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:44,146 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:44,146 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:44,147 INFO L185 omatonBuilderFactory]: Interpolants [2064#true, 2065#false, 2066#(= ULTIMATE.start_ssl3_connect_~s__state~3 4448)] [2018-07-23 13:49:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-07-23 13:49:44,151 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:44,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:44,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:44,152 INFO L87 Difference]: Start difference. First operand 80 states and 103 transitions. Second operand 3 states. [2018-07-23 13:49:44,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:44,191 INFO L93 Difference]: Finished difference Result 175 states and 228 transitions. [2018-07-23 13:49:44,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:44,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-07-23 13:49:44,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:44,193 INFO L225 Difference]: With dead ends: 175 [2018-07-23 13:49:44,193 INFO L226 Difference]: Without dead ends: 98 [2018-07-23 13:49:44,194 INFO L575 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-07-23 13:49:44,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-23 13:49:44,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-23 13:49:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-23 13:49:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2018-07-23 13:49:44,214 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 59 [2018-07-23 13:49:44,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:44,215 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2018-07-23 13:49:44,215 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:44,215 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2018-07-23 13:49:44,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-23 13:49:44,216 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:44,217 INFO L357 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 6, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:44,217 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:44,217 INFO L82 PathProgramCache]: Analyzing trace with hash 546967008, now seen corresponding path program 1 times [2018-07-23 13:49:44,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 126 proven. 5 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 13:49:44,274 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:44,274 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:49:44,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:44,276 INFO L185 omatonBuilderFactory]: Interpolants [2613#true, 2614#false, 2615#(= ULTIMATE.start_ssl3_connect_~s__state~3 4480), 2616#(= ULTIMATE.start_ssl3_connect_~s__state~3 4512)] [2018-07-23 13:49:44,276 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 126 proven. 5 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 13:49:44,276 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:44,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:44,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:44,278 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand 4 states. [2018-07-23 13:49:44,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:44,362 INFO L93 Difference]: Finished difference Result 235 states and 309 transitions. [2018-07-23 13:49:44,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:44,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-07-23 13:49:44,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:44,364 INFO L225 Difference]: With dead ends: 235 [2018-07-23 13:49:44,364 INFO L226 Difference]: Without dead ends: 140 [2018-07-23 13:49:44,365 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-07-23 13:49:44,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-07-23 13:49:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-23 13:49:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2018-07-23 13:49:44,392 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 68 [2018-07-23 13:49:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:44,396 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2018-07-23 13:49:44,396 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2018-07-23 13:49:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-23 13:49:44,398 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:44,398 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:44,399 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:44,399 INFO L82 PathProgramCache]: Analyzing trace with hash -884900529, now seen corresponding path program 2 times [2018-07-23 13:49:44,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:44,487 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 175 proven. 20 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 13:49:44,487 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:44,488 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:49:44,488 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:44,489 INFO L185 omatonBuilderFactory]: Interpolants [3361#true, 3362#false, 3363#(= ULTIMATE.start_ssl3_connect_~s__state~3 4480), 3364#(= 4512 ULTIMATE.start_ssl3_connect_~s__state~3), 3365#(not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384))] [2018-07-23 13:49:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 175 proven. 20 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 13:49:44,492 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:49:44,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:49:44,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:44,493 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 5 states. [2018-07-23 13:49:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:44,587 INFO L93 Difference]: Finished difference Result 289 states and 338 transitions. [2018-07-23 13:49:44,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:49:44,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-07-23 13:49:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:44,589 INFO L225 Difference]: With dead ends: 289 [2018-07-23 13:49:44,590 INFO L226 Difference]: Without dead ends: 155 [2018-07-23 13:49:44,591 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:44,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-23 13:49:44,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-23 13:49:44,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-23 13:49:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2018-07-23 13:49:44,621 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 78 [2018-07-23 13:49:44,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:44,621 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2018-07-23 13:49:44,621 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:49:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2018-07-23 13:49:44,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-23 13:49:44,629 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:44,629 INFO L357 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 8, 7, 6, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:44,629 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:44,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1238609406, now seen corresponding path program 3 times [2018-07-23 13:49:44,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 224 proven. 45 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 13:49:44,760 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:44,760 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:49:44,760 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:44,761 INFO L185 omatonBuilderFactory]: Interpolants [4256#(= ULTIMATE.start_ssl3_connect_~s__state~3 4480), 4257#(= 4512 ULTIMATE.start_ssl3_connect_~s__state~3), 4258#(not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~3)), 4259#(not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384)), 4254#true, 4255#false] [2018-07-23 13:49:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 224 proven. 45 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 13:49:44,762 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:49:44,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:49:44,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:49:44,763 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand 6 states. [2018-07-23 13:49:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:44,870 INFO L93 Difference]: Finished difference Result 337 states and 409 transitions. [2018-07-23 13:49:44,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:49:44,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-07-23 13:49:44,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:44,872 INFO L225 Difference]: With dead ends: 337 [2018-07-23 13:49:44,872 INFO L226 Difference]: Without dead ends: 185 [2018-07-23 13:49:44,874 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:49:44,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-23 13:49:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-23 13:49:44,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-23 13:49:44,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 228 transitions. [2018-07-23 13:49:44,899 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 228 transitions. Word has length 88 [2018-07-23 13:49:44,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:44,900 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 228 transitions. [2018-07-23 13:49:44,900 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:49:44,901 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 228 transitions. [2018-07-23 13:49:44,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-23 13:49:44,905 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:44,905 INFO L357 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 9, 8, 7, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:44,905 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:44,906 INFO L82 PathProgramCache]: Analyzing trace with hash -473952275, now seen corresponding path program 4 times [2018-07-23 13:49:44,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 247 proven. 65 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-07-23 13:49:45,047 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:45,047 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:49:45,047 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:45,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:45,048 INFO L185 omatonBuilderFactory]: Interpolants [5312#(or (= 4512 ULTIMATE.start_ssl3_connect_~s__state~3) (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (not (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4384))), 5313#(not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384)), 5307#true, 5308#false, 5309#(= ULTIMATE.start_ssl3_connect_~s__state~3 4480), 5310#(= 4512 ULTIMATE.start_ssl3_connect_~s__state~3), 5311#(or (= 4512 ULTIMATE.start_ssl3_connect_~s__state~3) (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3))] [2018-07-23 13:49:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 247 proven. 65 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-07-23 13:49:45,049 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:49:45,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:49:45,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:49:45,050 INFO L87 Difference]: Start difference. First operand 185 states and 228 transitions. Second operand 7 states. [2018-07-23 13:49:45,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:45,252 INFO L93 Difference]: Finished difference Result 392 states and 478 transitions. [2018-07-23 13:49:45,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:49:45,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-07-23 13:49:45,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:45,253 INFO L225 Difference]: With dead ends: 392 [2018-07-23 13:49:45,253 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:49:45,254 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:49:45,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:49:45,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:49:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:49:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:49:45,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2018-07-23 13:49:45,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:45,257 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:49:45,257 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:49:45,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:49:45,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:49:45,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:49:45,747 INFO L417 ceAbstractionStarter]: At program point L300(lines 300 326) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384))) (.cse1 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) (and .cse1 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and .cse0 (or (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse1) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse1) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse1) (and .cse1 (= ULTIMATE.start_ssl3_connect_~s__state~3 4512)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse1))) [2018-07-23 13:49:45,747 INFO L421 ceAbstractionStarter]: For program point L420(lines 420 437) no Hoare annotation was computed. [2018-07-23 13:49:45,748 INFO L417 ceAbstractionStarter]: At program point L463(lines 257 463) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384)) (or (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4512)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-07-23 13:49:45,749 INFO L417 ceAbstractionStarter]: At program point L264(lines 264 285) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384)) (or (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4512)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-07-23 13:49:45,750 INFO L417 ceAbstractionStarter]: At program point L268(lines 234 268) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384)) (or (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4512)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-07-23 13:49:45,751 INFO L421 ceAbstractionStarter]: For program point L296(lines 296 307) no Hoare annotation was computed. [2018-07-23 13:49:45,751 INFO L417 ceAbstractionStarter]: At program point L372(lines 372 399) the Hoare annotation is: false [2018-07-23 13:49:45,751 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 2 464) no Hoare annotation was computed. [2018-07-23 13:49:45,751 INFO L417 ceAbstractionStarter]: At program point L362(lines 362 373) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5))) [2018-07-23 13:49:45,752 INFO L417 ceAbstractionStarter]: At program point L366(lines 366 391) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384))) (.cse1 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) (and .cse0 (or (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse1) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse1) (and .cse1 (= ULTIMATE.start_ssl3_connect_~s__state~3 4512)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse1))) [2018-07-23 13:49:45,753 INFO L417 ceAbstractionStarter]: At program point L288(lines 288 297) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384)) (or (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4512)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-07-23 13:49:45,753 INFO L421 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2018-07-23 13:49:45,757 INFO L417 ceAbstractionStarter]: At program point L401(lines 398 415) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384))) (.cse1 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) (and .cse0 (or (= 4512 ULTIMATE.start_ssl3_connect_~s__state~3) (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse1) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse1))) [2018-07-23 13:49:45,758 INFO L417 ceAbstractionStarter]: At program point L329(lines 329 351) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384))) (.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) (and .cse1 (or (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4512)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0))) [2018-07-23 13:49:45,758 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 2 464) the Hoare annotation is: true [2018-07-23 13:49:45,758 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 2 464) no Hoare annotation was computed. [2018-07-23 13:49:45,758 INFO L421 ceAbstractionStarter]: For program point L311(lines 306 330) no Hoare annotation was computed. [2018-07-23 13:49:45,759 INFO L417 ceAbstractionStarter]: At program point L354(lines 354 363) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384))) (.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) (and .cse1 (or (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4512)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0))) [2018-07-23 13:49:45,759 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 400) the Hoare annotation is: false [2018-07-23 13:49:45,763 INFO L417 ceAbstractionStarter]: At program point L239(lines 239 258) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_connect_~blastFlag~3 5)))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (and (not (= ULTIMATE.start_ssl3_connect_~s__state~3 4384)) (or (= 4528 ULTIMATE.start_ssl3_connect_~s__state~3) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3 4560) (= ULTIMATE.start_ssl3_connect_~s__state~3 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3)) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4480) .cse0) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4448) .cse0) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4512)) (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4432) .cse0) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-07-23 13:49:45,801 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:49:45 BoogieIcfgContainer [2018-07-23 13:49:45,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:49:45,803 INFO L168 Benchmark]: Toolchain (without parser) took 3827.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 412.2 MB). Peak memory consumption was 412.2 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:45,805 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:49:45,807 INFO L168 Benchmark]: Boogie Preprocessor took 100.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:49:45,808 INFO L168 Benchmark]: RCFGBuilder took 661.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:45,809 INFO L168 Benchmark]: TraceAbstraction took 3060.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 391.1 MB). Peak memory consumption was 391.1 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:45,815 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 661.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3060.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 391.1 MB). Peak memory consumption was 391.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 400]: 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: 257]: Loop Invariant Derived loop invariant: (((((((!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416) || ((!(ssl3_connect_~s__state~3 == 4384) && ((4528 == ssl3_connect_~s__state~3 || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~s__state~3 == 4368) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4512)) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416) || ((!(ssl3_connect_~s__state~3 == 4384) && ((4528 == ssl3_connect_~s__state~3 || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5))) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4512)) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5)) || (!(ssl3_connect_~s__state~3 == 4384) && ssl3_connect_~blastFlag~3 <= 2)) || ((!(ssl3_connect_~s__state~3 == 4384) && ((4528 == ssl3_connect_~s__state~3 || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4512)) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5)) - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((((!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416) || ((!(ssl3_connect_~s__state~3 == 4384) && ((4528 == ssl3_connect_~s__state~3 || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~s__state~3 == 4368) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4512)) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: ((((((!(ssl3_connect_~s__state~3 == 4384) && ssl3_connect_~blastFlag~3 <= 2) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416)) || ((!(ssl3_connect_~s__state~3 == 4384) && ((4528 == ssl3_connect_~s__state~3 || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5))) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4512)) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5)) - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: ((((!(ssl3_connect_~s__state~3 == 4384) && ssl3_connect_~blastFlag~3 <= 2) || ((!(ssl3_connect_~s__state~3 == 4384) && ((4528 == ssl3_connect_~s__state~3 || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4512)) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5)) - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: (((((((!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416) || ((!(ssl3_connect_~s__state~3 == 4384) && ((4528 == ssl3_connect_~s__state~3 || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~s__state~3 == 4368) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4512)) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5)) || (!(ssl3_connect_~s__state~3 == 4384) && ssl3_connect_~blastFlag~3 <= 2)) || ((!(ssl3_connect_~s__state~3 == 4384) && ((4528 == ssl3_connect_~s__state~3 || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416)) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4512)) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5)) - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: (((((((!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4416) || ((!(ssl3_connect_~s__state~3 == 4384) && ((4528 == ssl3_connect_~s__state~3 || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4448 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~s__state~3 == 4368) || (!(ssl3_connect_~blastFlag~3 == 5) && ssl3_connect_~s__state~3 == 4512)) || (ssl3_connect_~s__state~3 == 4432 && !(ssl3_connect_~blastFlag~3 == 5))) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((!(ssl3_connect_~s__state~3 == 4384) && ssl3_connect_~blastFlag~3 <= 2) || ((!(ssl3_connect_~s__state~3 == 4384) && (((4512 == ssl3_connect_~s__state~3 || 4528 == ssl3_connect_~s__state~3) || ssl3_connect_~s__s3__tmp__next_state___0~3 == 4560) || ssl3_connect_~s__state~3 == ssl3_connect_~s__s3__tmp__next_state___0~3)) && !(ssl3_connect_~blastFlag~3 == 5))) || (ssl3_connect_~s__state~3 == 4480 && !(ssl3_connect_~blastFlag~3 == 5)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 2.9s OverallTime, 13 OverallIterations, 13 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 233 SDtfs, 74 SDslu, 131 SDs, 0 SdLazy, 734 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 1661/1816 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 213 NumberOfFragments, 625 HoareAnnotationTreeSize, 14 FomulaSimplifications, 4359 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 558 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 606 NumberOfCodeBlocks, 606 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 593 ConstructedInterpolants, 0 QuantifiedInterpolants, 72219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 1661/1816 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.BV.c.cil.c_19.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-49-45-838.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.BV.c.cil.c_19.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-49-45-838.csv Received shutdown request...